Question # 1 of 10 Total Marks: 1

The _____ of the in a binary tree is defined as the height of its left sub tree

minus the height of its right sub tree.

Height

Balance

Depth

None of above

Question # 2 of 10 Total Marks: 1

In which case of insertion a single rotation can make the AVL tree balanced?

An insertion into left subtree of the left child of α.

An insertion into right subtree of the left child of α.

An insertion into left subtree of the right child of α.

None of above.

Question # 3 of 10 Total Marks: 1

The _____ of a binary tree is the maximum levels of its leaves (also called

the depth)?

Level

Width

Height

None of the above

Question # 4 of 10 Total Marks: 1

Maximum time an insertion operation can take in AVL tree is? Here Log

stands for Log to the base of 2.

Log(n)

1.44 Log (n)

1.66 Log (n)

Log (n+1)

Question # 5 of 10 Total Marks: 1

Which one of the following is to more close to AVL Tree?

BST

Complete BST

Heap

None of above

Imrangee

Question # 6 of 10 Total Marks: 1

Which of the following data structure is of linear type?

Strings

Queues

Lists

All of above

Question # 7 of 10 Total Marks: 1

A binary search tree (BST) every node has two or zero node is called_____.

Complete BST

BST

Extended BST

None of above

Question # 8 of 10 Total Marks: 1

Which data structure allows inserting elements at the back and removing

from the front?

Stacks

Queues

BST

Deques

Question # 9 of 10 Total Marks: 1

BST violates the condition of AVL when any node has a balance equal

to____

2 or -2

1 or -1

0

None of above

Question # 10 of 10 Total Marks: 1

Incase of insertion of left outer node in BST we apply___

Single right rotation to make it AVL

Single left rotation to make it AVL

Double rotation, first left then right rotation.

None of above