Binary Search Tree Quiz No 2

What is a Binary Search Tree (BST)?

• A tree where each node has three children.

• A tree where the value of the left child is smaller and the value of the right child is larger than the parent node.

• A tree where all nodes have the same value.

• A tree where nodes are arranged in a random order.

In a Binary Search Tree, which child of a node contains values smaller than the node's value?

• Left child

• Right child

• Both left and right children

• Neither left nor right child

What is the minimum number of nodes required to form a BST?

• 0

• 1

• 2

• 3

Which traversal method of a BST visits the nodes in ascending order?

• Pre-order

• Post-order

• In-order

• Level-order

If a value is smaller than the root in a Binary Search Tree, where does it go?

• Right subtree

• Left subtree

• Root itself

• It cannot be inserted

What happens if a node to be deleted in a Binary Search Tree has no children?

• The node is replaced by its in-order successor.

• The node is removed directly.

• The node is replaced by its in-order predecessor.

• None of the above

What is the purpose of using a Binary Search Tree?

• To store data in a random order

• To perform efficient searching, insertion, and deletion

• To arrange nodes in ascending order only

• To guarantee balanced tree structure

Which node in a Binary Search Tree has no parent?

• Root node

• Leaf node

• Sibling node

• Internal node

If a node has only one child in a Binary Search Tree, which side can the child be on?

• Left side

• Right side

• Both left and right sides

• Neither left nor right side

What does a Binary Search Tree ensure regarding the arrangement of its nodes?

• Random order

• Descending order

• Ascending order

• No specific order