**1. **

The balance factor for an AVL tree is either

(a) 0,1 or –1

(b) –2,–1 or 0

(c) 0,1 or 2

(d) All the above

**2. **

What is the maximum height of any AVL-tree with 7 nodes? Assume that the height of a tree with a single node is 0.

(a) 2

(b) 3

(c) 4

(d) 5

1) the height difference of the children is at most 1.

2) both children are AVL trees

**3. **

What is the maximum height of any AVL-tree with 7 nodes? Assume that the height of a tree with a single node is 0.

(a) 2

(b) 3

(c) 4

(d) 5

1) the height difference of the children is at most 1.

2) both children are AVL trees

**4. **

Re-balancing of AVL tree costs

(a) Ο(1)

(b) Ο(log n)

(c) Ο(n)

(d) Ο(n2)

Answer

**5.**

In ______________ tree, the heights of two child subtree of any node differ by at most one

(a) Binary tree

(b) Red black tree

(c) Splay tree

(d) AVL tree

Answer

**6. **

AVL Trees have a faster

(a) insertion

(b) deletion

(c) updation

(d) retrival

Answer

**7. **

How is an insertion of a node into an AVL tree carried out?

(a) By treating an AVL tree as a binary search tree

(b) By updating the balance factors working upward from insertion point to the root

(c) Both a & b

(d) None of the Above

Answer

**8. **

What would happen if the balance factor of a node in an AVL tree is ‘ 1 ‘

(a) Heights of left and right sub trees become equal

(b) Height of left sub tree is one more than the height of right sub tree

(c) Height of left sub tree is one less than the height of right tree

(d) None of the Above

Answer

**9. **

The number of possible binary trees with 5 nodes is.

(a) 40

(b) 41

(c) 42

(d) 32

Answer

**10. **

Which of the following techniques represents the precise sequence of an In – Order Traversal of a Binary Tree?

(a) Visit the Root, Traverse Left Subtree, Traverse Right Subtree

(b) Traverse Left Subtree; Visit the Root, Traverse Right Subtree

(c) Traverse Left Subtree, Traverse Right Subtree, Visit the Root

(d) None of the Above

Answer