ONE 6th FORM Binary Search Tree

What does the left subtree of a node in a Binary Search Tree contain?

• Elements with duplicate keys

• Elements equal to the node

• Elements smaller than the node

• Elements greater than the node

Which operation is used to find a key in a Binary Search Tree?

• remove(x)

• insert(x)

• update(x)

• search(x)

How is insertion into a Binary Search Tree done?

• Recursively

• Using a stack

• Using a queue

• Iteratively

What is the correct algorithm for deletion in a Binary Search Tree?

• Find the successor and remove it

• Find the predecessor and remove it

• Delete the root node

• Delete the leaf nodes

What is the property of Binary Search Tree that makes searching easy?

• Elements are sorted in descending order

• Elements are sorted in ascending order

• Elements are randomly arranged

• Elements are stored in a linked list

What does the right subtree of a node in a Binary Search Tree contain?

• Elements greater than the node

• Elements smaller than the node

• Elements equal to the node

• Elements with duplicate keys

Which traversal method is described as "Left, Root, Right"?

• Pre-order

• In-order

• Post-order

• Level-order

What is the first step in an in-order traversal?

• Visit the root

• Traverse the left sub-tree

• Traverse the right sub-tree

• Visit the right sub-tree

In an in-order traversal, which node is visited last?

• Root

• Left

• Right

• None

Which traversal method is used to get the nodes of a binary search tree in ascending order?

• Pre-order

• In-order

• Post-order

• Level-order