Binary Search Trees and Balanced Trees Quiz

In the worst case, a binary search tree will take how much time to search an element?

• O(n)

• O(log n)

• O(n^2)

• O(n log n)

How much time does an AVL tree take to perform insert, insert, and delete operations in the average case as well as the worst case?

• O(n)

• O(log n)

• O(n^2)

• O(n log n)

When the left sub-tree of the tree is one level higher than that of the right sub-tree, then the balance factor is

• 0

• 1

• -1

• 2

Which rotation is done when the new node is inserted in the right sub-tree of the right sub-tree of the critical node?

• LL

• LR

• RL

• RR

When a node N is accessed it is splayed to make it the

• Root node

• Parent node

• Child node

• Sibling node

In a binary search tree, all the nodes in the left sub-tree have a value less than that of the root node.

• True

• False

To find the node with the largest value, we will find the value of the rightmost node of the ____ ____ _____.

If the thread appears in the right field, then it will point to the ____ _________of the node.

Searching an AVL tree takes ____ time.

____ rotation is done when the new node is inserted in the left sub-tree of the left sub-tree of the critical node.