Consider the $.$insert$()$ function from Lecture $8$ when answering the following question.

Let's say we want to insert a new number xx into a binary search tree. Define height$\_$left as the height of the left half of the binary tree $($the root and everything to the left of it$),$ and height$\_$right as the height of the right side. Let height$\_$left be greater than height$\_$right. In the worst case, how many iterations of the while loop of $.$insert$()$ will need to be completed?

Choice $1$ of $4$: height$\_$leftChoice $2$ of $4$: height$\_$rightChoice $3$ of $4$: height$\_$left $+$ height$\_$rightChoice $4$ of $4$: None of the above

Save Answer