Interested to Buy Any Domain ? << Click Here >> for more details...
Answer Posted / pilli.ramakrishna (student of
An AVL tree is a self-balancing binary search tree, and it
was the first such data structure to be invented.In an AVL
tree, the heights of the two child subtrees of any node
differ by at most one. Lookup, insertion, and deletion all
take O(log n) time in both the average and worst cases,
where n is the number of nodes in the tree prior to the
operation. Insertions and deletions may require the tree to
be rebalanced by one or more tree rotations.
| Is This Answer Correct ? | 7 Yes | 0 No |
Post New Answer View All Answers
What is hash value of a string?
What is a priority queue?
What is difference between list set and map?
What is the height of an empty tree?
What is comparator interface used for?
What is raid (redundant array of inexpensive disks)?
Which is faster hashmap or treemap?
How can a binary tree be represented using the rotation?
Is hashmap sorted?
What does sorting an array do?
What package is arraylist?
How many passes are required in bubble sort?
Explain the internal working of a hash map?
Difference between hashset and treeset?
What is a graph?
