Virtual Labs

1. Following is the image of a binary search tree rooted at 4

(which child is left and which is right is arbitrary, but assigned so to maintain validity of the tree). Which of the following can be the nodes you visit when searching for the number 10.

a: 4 6 7 10 Explanation

Explanation

b: 4 6 7 8 Explanation

Explanation

c: 4 3 1 2 Explanation

Explanation

d: 4 6 5 10 Explanation

Explanation

2. To find the smallest element in the subtree of a given node, we:

a: Go recursively into the left child of the current node, and stop when no left child exists. Explanation

Explanation

b: Go recursively into the left child of the current node, go to the right child otherwise, and stop when neither one exists. Explanation

Explanation

c: Go recursively into the right child of the current node, and stop when no left child exists. Explanation

Explanation

d: Go recursively into the right child of the current node, go to the right child otherwise, and stop when neither one exists. Explanation

Explanation

Binary Search Tree