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

Which operation is used to insert a new key into a Binary Search Tree?

• search(x)

• remove(x)

• insert(x)

• find(x)

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