<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/">
  <channel>
    <title>AVL Trees on Changlin&#39;s Blog</title>
    <link>https://timely-sprinkles-c55fc0.netlify.app/tags/avl-trees/</link>
    <description>Recent content in AVL Trees on Changlin&#39;s Blog</description>
    <generator>Hugo -- gohugo.io</generator>
    <language>en-us</language>
    <lastBuildDate>Sun, 17 Dec 2023 13:38:20 -0600</lastBuildDate><atom:link href="https://timely-sprinkles-c55fc0.netlify.app/tags/avl-trees/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>AVL Trees</title>
      <link>https://timely-sprinkles-c55fc0.netlify.app/posts/avltrees/</link>
      <pubDate>Sun, 17 Dec 2023 13:38:20 -0600</pubDate>
      
      <guid>https://timely-sprinkles-c55fc0.netlify.app/posts/avltrees/</guid>
      <description>AVL Trees AVL Trees is also known as self balancing tree. Self balancing means doing some operations, the tree tries to keep its height as low as possible.
In an avl tree the height of the two sub trees differ at most one(defined as balance factor), we also have a formula for this balance factor based on this property:
balance factor = height of left subtree - height of right subtree</description>
    </item>
    
  </channel>
</rss>
