Section 25.6 Check Point Questions2 questions

25.6.1

Show the inorder, preorder, and postorder of traversing the elements in the binary tree shown in Figure 25.1c.

25.6.2

If a set of elements is inserted into a BST in two different orders, will the two corresponding BSTs look the same? Will the inorder traversal be the same? Will the postorder traversal be the same? Will the preorder traversal be the same?