Interested to Buy Any Domain ? << Click Here >> for more details...
Answer Posted / narendra sharma
Avl tree is self binary tree in which balancing factor lie
between the -1 to 1.It is also known as self balancing tree.
so BF=h(T(left sub tree))-h(T(right sub tree));
| Is This Answer Correct ? | 57 Yes | 2 No |
Post New Answer View All Answers
How can you insert a node in a random location of the linked list?
What are the tasks performed during inorder traversal?
Will hashmap allow null keys?
If we try to add duplicate key to the hashmap, what will happen?
How to reverse a singly linked list?
What is worst case complexity algorithm?
What is a hash in programming?
what is the difference between singly and doubly linked lists?
What is a stable algorithm?
Which process places data at the back of the queue?
What are linked list?
What is difference between array and string?
How does arraylist store data?
Is bubble sort adaptive?
How to copy an array into another array?
