mirror of
https://github.com/mfocko/blog.git
synced 2024-11-15 10:27:31 +01:00
34 lines
537 B
Markdown
34 lines
537 B
Markdown
|
---
|
||
|
|
id: avl
|
||
|
|
slug: /rank-balanced-trees/avl
|
||
|
|
title: AVL tree
|
||
|
|
description: |
|
||
|
|
Explaining the idea behind the AVL tree.
|
||
|
|
tags:
|
||
|
|
- balanced trees
|
||
|
|
- avl tree
|
||
|
|
last_update:
|
||
|
|
date: 2024-06-30
|
||
|
|
---
|
||
|
|
|
||
|
|
Let's start by checking out the AVL tree. We will cover the historic context
|
||
|
|
first, then go through the idea behind it and finally we will be able to discuss
|
||
|
|
the insertion and deletion corrections that are used to maintain the property of
|
||
|
|
a balanced tree.
|
||
|
|
|
||
|
|
## Historic context
|
||
|
|
|
||
|
|
_TODO_
|
||
|
|
|
||
|
|
## Idea
|
||
|
|
|
||
|
|
_TODO_
|
||
|
|
|
||
|
|
## Insertion
|
||
|
|
|
||
|
|
_TODO_
|
||
|
|
|
||
|
|
## Deletion
|
||
|
|
|
||
|
|
_TODO_
|