Please refer below post before reading about AVL tree handling of duplicates.
This is to augment AVL tree node to store count together with regular fields like key, left and right pointers.
Insertion of keys 12, 10, 20, 9, 11, 10, 12, 12 in an empty Binary Search Tree would create following.
12(3) / \ 10(2) 20(1) / \ 9(1) 11(1)
Count of a key is shown in bracket
Below is implementation of normal AVL Tree with count with every key. This code basically is taken from code for insert and delete in AVL tree. The changes made for handling duplicates are highlighted, rest of the code is same.
The important thing to note is changes are very similar to simple Binary Search Tree changes.
Pre order traversal of the constructed AVL tree is 9(2) 5(2) 7(1) 10(1) 17(1) Pre order traversal after deletion of 9 9(1) 5(2) 7(1) 10(1) 17(1)
Thanks to Rounaq Jhunjhunu Wala for sharing initial code. Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- AVL Tree | Set 1 (Insertion)
- AVL Tree | Set 2 (Deletion)
- Count greater nodes in AVL tree
- Complexity of different operations in Binary tree, Binary Search Tree and AVL tree
- Practice questions on Height balanced/AVL Tree
- Red Black Tree vs AVL Tree
- Minimum number of nodes in an AVL Tree with given height
- Optimal sequence for AVL tree insertion (without any rotations)
- Print BST keys in the given range
- BST to a Tree with sum of all smaller keys
- Check if a Binary Tree contains duplicate subtrees of size 2 or more
- Find All Duplicate Subtrees
- Check if a Binary Tree (not BST) has duplicate values
- Count the nodes of a tree whose weighted string does not contain any duplicate characters
- Duplicate subtree in Binary Tree | SET 2