Binary Search Tree Quiz

What is a binary search tree?

• A tree where the value of the left node is equal to the parent node

• A tree where the value of the left node is smaller than the parent node and the value of the right node is greater than the parent node

• A tree where the value of the left node is smaller than the parent node

• A tree where the value of the left node is greater than the parent node

How is the inorder traversal helpful in a binary search tree?

• It gives data in descending order

• It gives data in ascending order

• It gives data in level order

• It gives data in random order

What is the space complexity for deletion in a binary search tree?

• O(n)

• O(1)

• O(log n)

• O(n^2)

When is the inorder successor needed in the deletion of a node in a binary search tree?

• When the node to be deleted is the root node

• When the node to be deleted has only one child

• When the node to be deleted has two children

• When the node to be deleted is a leaf node

What is the time complexity for search in a binary search tree in the best case?

• O(n^2)

• O(n)

• O(1)

• O(log n)

What happens when a node to be deleted in a binary search tree has only one child?

• The node is directly deleted

• The node is replaced with its child and then the child is deleted

• The node is replaced with its parent

• The node is replaced with its sibling

What is the space complexity for search in a binary search tree?

• O(n)

• O(1)

• O(log n)

• O(n^2)

What is the main advantage of a binary search tree?

• It cannot store data in a hierarchical form

• Searching an element is easy

• Insertion and deletion operations are slower

• Searching an element is difficult

What is the time complexity for deletion in a binary search tree in the average case?

• O(log n)

• O(n)

• O(n^2)

• O(1)