From f155e66b008b8f3701ce4b25d2558b55e847ef4d Mon Sep 17 00:00:00 2001 From: Matej Focko Date: Sun, 9 Jun 2024 23:57:33 +0200 Subject: [PATCH] algorithms(rank-balanced-trees): add skeleton for AVL Signed-off-by: Matej Focko --- algorithms/99-rank-balanced-trees/01-avl.md | 33 +++++++++++++++++++++ 1 file changed, 33 insertions(+) create mode 100644 algorithms/99-rank-balanced-trees/01-avl.md diff --git a/algorithms/99-rank-balanced-trees/01-avl.md b/algorithms/99-rank-balanced-trees/01-avl.md new file mode 100644 index 0000000..a45a09c --- /dev/null +++ b/algorithms/99-rank-balanced-trees/01-avl.md @@ -0,0 +1,33 @@ +--- +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_