1.The inorder traversal sequence of an AVL tree must be in sorted (non-decreasing) order.
T
F
According to the nature of binary search tree, preorder must be ordered, but is increasing.
1.The inorder traversal sequence of an AVL tree must be in sorted (non-decreasing) order.
According to the nature of binary search tree, preorder must be ordered, but is increasing.