UGC NET CS 2012 Dec-Paper-2

Question 2

The worst case time complexity of AVL tree is better in comparison to binary search tree for

A	Search and Insert Operations
B	Search and Delete Operations
C	Insert and Delete Operations
D	Search, Insert and Delete Operations

Question 2 Explanation:

AVL tree is a self balancing tree with height difference at most 1. A balance factor in AVL tree is used to check what rotation to make.

Correct Answer: D

Question 2 Explanation:

AVL tree is a self balancing tree with height difference at most 1. A balance factor in AVL tree is used to check what rotation to make.