Suppose we have the following binary search tree stored in a variable called bst$.$

BST$\_$ diagram after deleting a node$(1).$png

When we call bst$.\_\_$contains$\_\_(17),$ which values in the tree are checked? $($By "checked" we mean, which values are compared against the $17$ in the code for bst$.\_\_$contains$\_\_.)$