Suppose the numbers 7,5, 1, 8, 3, 6, 0, 9, 4, 2 are inserted in that order into an initially empty binary search tree. The binary search tree uses the usual ordering on natural numbers. List all leaf nodes of the resultant tree? The following numbers are inserted into an empty binary search tree in the given order: 1, 3, 5, 10, 12, 15, 16. What is the height of the binary search tree? Suppose the numbers 5, 7, 1, 8, 3, 6 are inserted in that order into an initially empty binary search tree. The binary search tree uses the usual ordering on natural numbers. What is the in-order traversal sequence of the resultant tree? 5, 7, 1, 8, 3, 6 8, 7, 6, 5, 3, 1 1, 3, 5, 6, 7, 8 5, 1, 3, 7, 6, 8