Introduction to Advanced Data Structures: WAVL Tree

Hi all, this is an introduction to a tree data structure called a weak AVL (WAVL) tree also known as a rank-balanced tree.

Link to the Research Paper

0:00 Introduction
1:24 Topic Overview
1:57 What is a WAVL Tree?
5:11 External Node Property
7:12 Internal Node Property
8:16 Rank Difference Property
9:38 1,2 Node
10:37 2,1 Node
10:48 1,1 Node
11:05 2,2 Node
11:18 WAVL Tree vs AVL Tree Visual
13:54 Relation to AVL Tree and Red-Black Tree

[achat]

I'n not even a CS major but YOU make learning about WAVL trees fun

[Amirhossein_Mn]

11:20 why node 17's rank is 2 and not 1? it's an internal node with two external children and it's rank should be 1; am i wrong?

[Nolord_]

Honestly, this was a great introduction to WAVL trees.
So I went deeper in the subject and implemented it. Then I needed a representation of a WAVL tree to try stuff on it. So I went on the internet, and found the tree you used at 11:18.
But it isn't a WAVL tree !
17 has rank 2, but should be rank 1. The same goes for 15 and 12.

[alexandrarumyantseva]

It would be great if you could go over some insertion/deletion examples to demo the benefits that were described in the last minute.

[yogitshankar]

Can you do one on join and split property please

[superdahoho]

I haven't got to this data structure yet but I will like the video first.
I"m sure i'll be using it sometime in the future.
I got over here after watching your NFA to DFA video and it was immensely helpful.
too bad you only posted 2 videos, would be great to have more of your videos for the rest of my classes. c : D