Question 1
Show the preorder after inserting 1, 2, 4, 6, 3 into an empty binary search tree.
◦ 2 4 1 3 6
◦ 1 2 3 4 6
◦ 1 2 6 4 3
◦ 1 4 2 3 6
◦ 1 2 4 3 6
Question 2
The time complexity for finding an element in a binary search tree is ________.
◦ O(nlogn)
◦ O(n)
◦ O(logn)
◦ O(1)