Suppose the numbers 7, 55, 11, 8, 3, 6, 0, 90, 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. What is the in-order traversal sequence of the resultant tree?