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
Compare Queue and Topic ?
What method removes the value from the top of a stack?
Which language is best for learning data structures and algorithms?
In depth questions regarding the data structures and the Databases used in the Projects developed.
What are the different types of collections?
Explain what is the bucket size, when the overlapping and collision occur at same time?
What do you mean by linear probing?
What is the difference between binary tree and binary search tree?
You are given a singly linked list. How would you find out if it contains a loop or not without using temporary space?
Which is faster binary or linear search?
How do you declare A pointer to array of three chars
What is a threaded binary tree? Explain its operation with example?
Write a Program for Reverse a linked list.
What are the different types of sorting in data structure?
What is a hash index?
