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 sorted map?
What is raid (redundant array of inexpensive disks)?
Differentiate between file and structure storage structure.
What do you mean by priority queue?
What is 2 dimensional linked list?
What are two types of sorting?
Which is better bubble sort or selection sort?
Can a null element added to a treeset or hashset?
Define leaves?
What is array and string?
Define balance factor of a node in avl tree?
What is sorting and classifying?
Why might quick sort might be better than merge sort?
What is 1d array?
What is the limit of arraylist?
