AVL TREE

AVL TREE is pretty similar to binary search tree but AVL can adjust the balance of the tree automatically

The root of the node AVL tree is 0
The leaf of the right or leaf of the left is 1.
if the leaf is more than 1 the tree will automatically adjust the balance






The above picture is from the right node input and will be rotating to the left.





and this other picture is node from the left side and the rotation will be going to the right.



the correct solution of the wrong AVL tree is below:-



here another example :-



Example of Single rotation





below example of Doubly rotation




Comments

Post a Comment

Popular posts from this blog

Pengertian kelas besar tentang head, curr, tail

Image
  The topic I learn today in Big class is about the concept position of where will our pointer be directed at when we have head, curr, and tail.   Let say we have a singly link list that we want to make a push insertion.To make it happen we need to know where our address is first before we start making push insertion. The push insertion will be pushing from the front(beginning) and make a pop will be delete address. struct node{   int data; // value   struct node *next, *prev; // address }*head,*curr,*tail; void push(int a) {     curr = (struct Data*)malloc(sizeof(struct Data));//create address     curr->value = a;//insert value input a         if(head==NULL){// if head don have any address then we create one         head = tail = curr;     }     else{         tail->next = curr;// move tail to curr         curr->...
Read more

Binary Search Tree(BNS)

Image
BNS is also known as versions of sorted version of binary tree for the node of the left subtree is contain smaller number than those store in x for the node of the right subtree is contain greater number than those store in x there are three operation in BNS: insert() search() remove() The insert of BNS is to store is done recursively. let the new node's key be X, then we have a number of 30 of the beginning of the first node. if the node key input is smaller it will move the node to the left subtree side, if the node key is greater than it will move to the right subtree side. here is the example:- Now we will discuss search of BNS or can be call find of BNS. The search is pretty easy it just finds the node key of the X in the tree. if the search found the node it search then it will print the "the node key is found in the tree". The search algorithm is pretty much similar to insert but it job not to insert but to find only. La...
Read more