Insert 1, 2, 3, 4, 5, and 6 one by one into an initially empty A

Insert 1, 2, 3, 4, 5, and 6 one by one into an initially empty AVL tree. Then the preorder traversal sequence of the resulting tree must be {4, 2, 1, 3, 5, 6}. ~@[](3)

答案：TRUE