<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Trees on icaoberg</title>
    <link>https://www.andrew.cmu.edu/user/icaoberg/tags/trees/</link>
    <description>Recent content in Trees on icaoberg</description>
    <generator>Hugo</generator>
    <language>en-us</language>
    <lastBuildDate>Sun, 03 May 2026 09:37:14 -0400</lastBuildDate>
    <atom:link href="https://www.andrew.cmu.edu/user/icaoberg/tags/trees/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Data structures - Splay tree</title>
      <link>https://www.andrew.cmu.edu/user/icaoberg/post/2026-05-03-data-structures-splay-tree/</link>
      <pubDate>Sun, 03 May 2026 00:00:00 +0000</pubDate>
      <guid>https://www.andrew.cmu.edu/user/icaoberg/post/2026-05-03-data-structures-splay-tree/</guid>
      <description>A splay tree is a self-balancing binary search tree that automatically moves recently accessed elements to the root through a process called splaying. This post defines splay trees, explains the splay operation and its rotation cases, walks through common operations like search, insert, and delete, and analyzes time complexity.</description>
    </item>
  </channel>
</rss>
