Consider the full binary search tree pictured in Figure 26-13a. Now imagine that you traverse the tree and save its data in a file. If you then read the file and add the data to an initially empty...

Consider the full binary search tree pictured in Figure 26-13a. Now imagine that you traverse the tree and save its data in a file. If you then read the file and add the data to an initially empty binary search tree, what tree will you get if the traversal was

a. Preorder

b. Inorder