Reconstruct a Binary Search Tree (BST) with the given traversal sequence. The first value is the root. 88 50 22 223 125 43 400 31 300 12 60 55 The root is 88, then do the BST. Small numbers in the left and large numbers in the right Given the following preorder and ignored of a BT, rebuild the BT. Inorder: 89 28 32 46 78 57 60 53 98 Preorder: 78 32 89 28 46 60 57 98 53 From the preorder, the root of the tree is 78 From the inorder, the left side of the tree is 89, 28,32,46