Extracted text: Suppose we have an empty tree and a sequence: 53, 30, 37, 12, 45, 24, 96. We want to input those numbers to have a binary search tree with a smallest height. Which of the following sequences should we choose? 37, 24, 12, 30, 53, 45, 96 О 45, 24, 53, 12, 37, 96, 30 30, 24, 12, 37, 45, 96, 53 12, 24, 30, 37, 45, 53, 96 None of the above