suppose the numbers 13, 11, 7, 14, 9, 12, 6, 15, 10, 8 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?