OS Data Structures Question:
Download Questions PDF

What is AVL tree?

Answer:

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.

Download OS Data Structures Interview Questions And Answers PDF

Previous QuestionNext Question
Explain real world example of polymorphism and encapsulation?What is a complexity of linear search, binery search?