Floor and ceiling

Questions 1 to 5 of 7

1. 1. In the floor walk for 65 on the tree 50, 30, 70, 20, 40, 60, 80, the walk saves 50 and then goes right at 50. Why is going right correct?

   Because 50 is larger than 65, so a bigger floor can only be on the rightBecause 50 is at or below 65, so it is a candidate, and a larger candidate at or below 65 may sit on the rightBecause the right side of 50 holds only values equal to 65Because a floor walk always goes right first, whatever the node's value is
2. 2. On the tree 50, 30, 70, 20, 40, 60, 80, what is the ceiling of 35? The value 35 is not stored in the tree.

   30None3540
3. 3. What does this print? It uses floor and ceiling from this lesson, on the tree built by inserting 50, 30, 70, 20, 40, 60 and 80 in that order. ``python print(floor(root, 45), ceiling(root, 45)) ``

   30 5045 4540 5040 70
4. 4. What does this print? It uses the same tree as the previous question. ``python print(floor(root, 50)) print(ceiling(root, 50)) print(floor(root, 10)) ``

   50 50 none50 60 2050 50 None50 50 20
5. 5. In the floor function of this lesson, what is the name of the local variable that holds the saved candidate? Give the name only.

   Type your answer.