What is AVL tree?
Submitted by: AdministratorAn 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.
Submitted by: Administrator
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.
Submitted by: Administrator
Read Online OS Data Structures Job Interview Questions And Answers
Top OS Data Structures Questions
| ☺ | Explain real world example of polymorphism and encapsulation? |
| ☺ | What is AVL tree? |
| ☺ | Why enum can not be used directly with printf function? |
| ☺ | What is a complexity of linear search, binery search? |
| ☺ | What is difference between the run time polymorphism and compile time poly morphism and about virtual function? |
Top Operating System (OS) Categories
| ☺ | RTOS Interview Questions. |
| ☺ | Windows 7 Interview Questions. |
| ☺ | MAC Operating System Interview Questions. |
| ☺ | Disk Operating System (DOS) Interview Questions. |
| ☺ | Shell Scripting Interview Questions. |
