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
List out the basic operations that can be performed on a stack?
What is the use of sorting the data?
What are the benefits of using arrays?
What are the difference between malloc() and calloc()?
Define 2-3 tree?
What do you mean by balance factor of a node in avl tree?
What is sequential search?
What method removes the value from the top of a stack?
What are three common types of traversals?
Describe queue operation.
How to increase stack limit in w3wp.exe?
What are the types of bulleted list?
What are splay trees?
What is the minimum number of queues that can be used to implement a priority queue?
How many types of data structure are there?
