How to insert Strings into an AVL Tree
Last Updated :
11 Oct, 2021
AVL Tree is a self-balancing Binary Search Tree (BST) where the difference between heights of left and right subtrees cannot be more than one for all nodes.
Examples:
The above tree is AVL because the differences between the heights of the left and right subtrees for every node are less than or equal to 1. Below is the example that is not an AVL Tree:
The above tree is not AVL because the differences between the heights of the left and right subtrees for 8 and 12 are greater than 1. It can be defined as a type of binary search tree that has all its nodes with a balance factor of -1, 0, or 1.
What is the balance factor: It is the difference in height between the two subtrees. (Balance Factor: Height of Left subtree - Height of right subtree)
Insertion of Strings in AVL Tree:
Below example demonstration of inserting the days of the week in the order: {Tuesday, Monday, Thursday, Saturday, Sunday, Friday, Wednesday}
Approach:
- If the node is empty(NULL), create the node with the first value given.
- If the new node is less than the previous node then insert the new node at the left
- If the new node is greater than the previous node then insert the new node at the right
Check if the tree is balanced:
- If the balance factor is greater than 1 then it can be either:
- Left-Left Case (then a single rotation is required to make it balanced).
- Or Left-Right Case(Double rotation required).
- If the balance factor is lesser than -1 then it can be either:
- Right-Right Case (Single rotation required).
- Or Right-Left Case (Double rotation required)
This process should be repeated for the insertion of all of the remaining nodes.
Points to Remember:
- Insert nodes accordingly: To make sure that the given tree remains AVL after every insertion, augment the standard BST insert operation to perform some re-balancing. Following are two basic operations that can be performed to re-balance a BST without violating the BST property (keys(left) < key(root) < keys(right)).
- Check the Balance Factor: The balance factor should always be -1, 0, 1 if not then there is a need to rotate the tree accordingly.
Steps To Create AVL Tree:
- So according to the given order, let's insert Tuesday, as it has no node so it has a balance factor of 0.
- The next step is to insert Monday to the left of Tuesday as it is alphabetically smaller(M < T). There is a need to check the balance factor of each node before inserting a new node. The tree is balanced as Tuesday is balanced because it has one subtree towards the left:
Balance Factor = height of the left subtree - the height of right subtree = 1 - 0 = 1
Therefore, the tree is balanced. Monday is also balanced because of balance factor 0.
- Next, insert Thursday. It is inserted to the left of Tuesday (as Th < Tu) and it is inserted to the right of Monday (as T>M). Now if the balance factor, is checked it can be seen that the balance factor of Tuesday is 2 so it is unbalanced, so there is a need to rotate the tree to make it balanced.
Note: In case if we don't remember the rules of rotation of AVL tree, still it can be balanced we just need to remember that: Left node < Root < Right node.
Example:
5 4
/ / \
3 -----> 3 5
\
4
- After that, insert Saturday, to the left of Thursday (S < T) and to the right of Monday (M < S).
- Sunday is inserted to the right of Saturday (Sa < Su). Now the tree is unbalanced, so it is rotated to make it again balanced.
- Friday is inserted following the same rules and the balance factor of Thursday becomes 2, so rotation is again done.
- After rotation, now the last node Wednesday is inserted to the right of Tuesday (as T<W).
If the AVL tree is checked, now the entire AVL tree is height-balanced as all the nodes have balance factors -1, 0, 1.
Similar Reads
AVL Tree Data Structure An AVL tree defined as a self-balancing Binary Search Tree (BST) where the difference between heights of left and right subtrees for any node cannot be more than one. Balance Factor = left subtree height - right subtree heightFor a Balanced Tree(for every node): -1 ≤ Balance Factor ≤ 1Example of an
5 min read
What is AVL Tree | AVL Tree meaning An AVL is a self-balancing Binary Search Tree (BST) where the difference between the heights of left and right subtrees of any node cannot be more than one. KEY POINTSIt is height balanced treeIt is a binary search treeIt is a binary tree in which the height difference between the left subtree and r
2 min read
Insertion in an AVL Tree AVL tree is a self-balancing Binary Search Tree (BST) where the difference between heights of left and right subtrees cannot be more than one for all nodes. Insertion in an AVL Tree follows the same basic rules as in a Binary Search Tree (BST):A new key is placed in its correct position based on BST
15+ min read
Insertion, Searching and Deletion in AVL trees containing a parent node pointer AVL tree is a self-balancing Binary Search Tree (BST) where the difference between heights of left and right subtrees cannot be more than one for all nodes. The insertion and deletion in AVL trees have been discussed in the previous article. In this article, insert, search, and delete operations are
15+ min read
Deletion in an AVL Tree We have discussed Insertion of AVL Tree. In this post, we will follow a similar approach for deletion.Steps to follow for deletion. To make sure that the given tree remains AVL after every deletion, we must augment the standard BST delete operation to perform some re-balancing. Following are two bas
15+ min read
How is an AVL tree different from a B-tree? AVL Trees: AVL tree is a self-balancing binary search tree in which each node maintain an extra factor which is called balance factor whose value is either -1, 0 or 1. B-Tree: A B-tree is a self - balancing tree data structure that keeps data sorted and allows searches, insertions, and deletions in
1 min read
Practice questions on Height balanced/AVL Tree AVL tree is binary search tree with additional property that difference between height of left sub-tree and right sub-tree of any node can’t be more than 1. Here are some key points about AVL trees:If there are n nodes in AVL tree, minimum height of AVL tree is floor(log 2 n). If there are n nodes i
4 min read
AVL with duplicate keys Please refer below post before reading about AVL tree handling of duplicates. How to handle duplicates in Binary Search Tree?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 Bin
15+ min read
Count greater nodes in AVL tree In this article we will see that how to calculate number of elements which are greater than given value in AVL tree. Examples: Input : x = 5 Root of below AVL tree 9 / \ 1 10 / \ \ 0 5 11 / / \ -1 2 6 Output : 4 Explanation: there are 4 values which are greater than 5 in AVL tree which are 6, 9, 10
15+ min read
Difference between Binary Search Tree and AVL Tree Binary Search Tree:A binary Search Tree is a node-based binary tree data structure that has the following properties: The left subtree of a node contains only nodes with keys lesser than the node’s key.The right subtree of a node contains only nodes with keys greater than the node’s key.The left and
2 min read