AVL Tree

-
AVL Tree is often asked in interviews or coding rounds by some companies like Oracle and SAP.Though some people leave AVL trees thinking its not important,but you can never know what they might ask you in interview.So Its good to know about it.If not completely then at least some basic concepts.




AVL Trees are Height Balanced binary search tree datastructure such that for every internal nodes the heights of the two child node differ by at most one.If the balanced is disturbed at any time re-balancing is to be done to again make it balanced.In AVL Tree searching,Insertion and Deletion takes O(logn) time.Insertion and Deletion may require to re-balance the tree using Tree rotation .


Let the height of last nodes be 1 the node above it be 2 and finally the root node be 4.You can see that the tree is balanced as the height of child nodes of internal nodes differ by the value of 1 or 0.Next we will discuss the Insertion of AVL Tree.


Insertion : It is necessary to check the balancing of the tree after insertion of new node.There is a term called balance factor which is calculated as H(left subtree)-H(Right subtree).For each node if the balanced factor remains +1,0 or -1 then there is no need of rotation but if balance factor is less then -1 or greater then +1 then Tree rotation is to be done to restore the balance.If insertion are performed serially after each insertion then atleat one of the cases out of four cases needs to be resolved to restore the balance.

The Four cases are :

Let P be the root node of some tree and R and L be right and left child respectively


If the balance factor of P is -2 then the right subtree outweighs the left subtree of the given node, and the balance factor of the right child (R) must be checked. The left rotation with P as the root is necessary.

 Right-Right 
If the balance factor of R is -1 , a single left rotation with P as the root is needed which is Right-Right case.

 Right-left
If the balance factor of R is +1, two different rotations are needed. The first rotation is a right rotation with R as the root. The second is a left rotation with P as the root which is Right-Left case

If the balance factor of P is 2, then the left subtree outweighs the right subtree of the given node, and the balance factor of the left child (L) must be checked. The right rotation with P as the root is necessary.


 Left-Left 
If the balance factor of L is +1 , a single right rotation with P as the root is needed which is Left-Left case.

 Left-Right
If the balance factor of L is -1, two different rotations are needed. The first rotation is a left rotation with L as the root. The second is a right rotation with P as the root which is Left-Right case.



Comments

Post a Comment

Popular posts from this blog

Tricky Questions or Puzzles in C

-
This post is about the Tricky Questions   or code snippet in C or C++ asked in most of the Interviews   (See Interview Experience ) by some of the good companies. You may know probably the right concept but it will not strike you at the interview and to crack all those Interview Questions  you should know some of them beforehand. If you are applying for Job related to JAVA then checkout the blog post  Tricky Questions in JAVA . 1) what will be the output of the following Printf function.   printf("%d",printf("%d",printf("%d",printf("%s","ILOVECPROGRAM")))); Ans-ILOVECPROGRAM1321 The above printf line gives output like this because printf returns the number of character successfully written in the output. So the inner printf("%s","ILOVECPROGRAM") writes 13 characters to the output so the outer printf function will print 13 and as 13 is of 2 characters so the next outer printf function will print 2 and then
Read more

Program to uncompress a string ie a2b3c4 to aabbbcccc

-
Below is the program to uncompress a string #include<stdio.h> #include<conio.h> #include<stdlib.h> int main() { char str[100]="a2b3c4d8u7"; for(int i=0;str[i]!='\0';i++) { if(i%2!=0) { for(int j=0;j<atoi(&str[i]);j++) { printf("%c",str[i-1]); } } } getch(); } Want to become a Data Engineer? Check out below blog posts  1.  5 Key Skills Every Data Engineer needs in 2023 2.  How to prepare for Data Engineering Interviews 3.  Top 25 Data Engineer Questions
Read more

Programs and Puzzles in technical interviews i faced

-
Image
I have attended interview of nearly 10 companies in my campus placements and sharing their experiences with you,though i did not got selected in any of the companies but i had great experience facing their interviews and it might help you as well in preparation of interviews.Here are some of the puzzles and programs asked to me in interview in some of the good companies. CHECK-OUT the VIDEO of  Technical Interview for SAP Labs, CA Tech & HP R&D 1) SAP Labs I attended sap lab online test in my college through campus placements.It had 3 sections,the first one is usual aptitude questions which i would say were little tricky to solve.The second section was Programming test in which you were provided snippet of code and you have to complete the code (See Tricky Code Snippets  ).The code are from different data structures like Binary Tree, AVL Tree etc.Then the third section had questions from Database,OS and Networks.After 2-3 hours we got the result and i was shortlisted
Read more