Binary Search Trees Quiz(2)

Which of the following properties is true for a Binary Search Tree (BST)?

• The left subtree contains only nodes with values greater than the node's value.

• The right subtree contains only nodes with values less than the node's value.

• Both left and right subtrees contain nodes with values less than the node's value.

• The left subtree contains only nodes with values less than the node's value.

When inserting a new value into a Binary Search Tree, which of the following steps is correct?

• Always insert the new value as the left child of the root.

• Compare the new value with the current node's value and move left if it is smaller, or right if it is larger.

• Insert the new value at the root regardless of its value.

• Always insert the new value as the right child of the root.

What is the time complexity of searching for a value in a balanced Binary Search Tree?

• O(n)

• O(log n)

• O(n log n)

• O(1)

In a Binary Search Tree, if you insert the values 10, 5, 15, 3, and 7 in that order, what will be the in-order traversal of the tree?

• 3, 5, 7, 10, 15

• 10, 5, 15, 3, 7

• 15, 10, 7, 5, 3

• 10, 15, 5, 3, 7

Which of the following statements about the deletion of a node in a Binary Search Tree is true?

• Deleting a node with no children is the most complex operation.

• Deleting a node with one child requires no adjustments to the tree.

• Deleting a node with two children requires finding a replacement node.

• Deleting a node does not affect the structure of the tree.

What is the primary purpose of using a Binary Search Tree?

• To store data in a linear format.

• To allow for efficient searching, insertion, and deletion of data.

• To create a static data structure.

• To ensure that all nodes have the same value.