Binary Search Tree Quiz

What is a Binary Search Tree (BST)?

• A tree where each node has at most two children.

• A tree where the left child contains values smaller than the parent, and the right child contains values greater.

• A tree that is always balanced.

• None of the above.

What is the inorder traversal?

• NRL

• LRN

• LNR

• RNL

What traversal method prints the BST elements in sorted order?

• Preorder

• Inorder

• Postorder

• Level Order

A BST contains the elements [10, 20, 5, 15, 30]. What is the inorder traversal result?

• 10, 5, 15, 20, 30

• 5, 10, 15, 20, 30

• 30, 20, 15, 10, 5

• 5, 15, 10, 20, 30

What is the Preorder traversal?

• NRL

• LRN

• NLR

• RNL

What condition makes a tree not a BST?

• A node's left child has a greater value than the node itself.

• A node's right child has a smaller value than the node itself.

• Both A and B.

• None of the above.

Which of the following ensures the best performance of a BST?

• Ensuring the tree remains balanced.

• Adding elements in a sorted manner.

• Adding elements in descending order.

• Using a fixed insertion order.

How many iterations will it take to find 50 in a BST containing [10, 20, 50, 5, 1]?

• 2

• 3

• 4

• 5

Which of the following operations can make a BST unbalanced?

• Repeated insertion of sorted elements.

• Deletion of leaf nodes.

• Searching for an element.

• None of the above.

What property ensures efficient search in a BST?

• Tree height is minimized.

• All nodes have two children.

• Left child is always smaller and right child is always larger.

• The tree is traversed in order.