(a) Set up a binary tree for the following list, in the given order, using alphabetical ordering: STOP, LET, THERE, TAPE, NONE, YOU, ANT, NINE, OAT, NUT.
(b) Explain step by step how you would search for the word TEST in your tree.
(c) What is the height of the shortest binary search tree that can hold all 10 words?
(d) Write the preorder traversal of the tree.
(e) Write the postorder traversal of the tree.
(f) Write the inorder traversal of the tree.

Question

(a) Set up a binary tree for the following list, in the given order, using alphabetical ordering: STOP, LET, THERE, TAPE, NONE, YOU, ANT, NINE, OAT, NUT. 
(b) Explain step by step how you would search for the word TEST in your tree. 
(c) What is the height of the shortest binary search tree that can hold all 10 words? 
(d) Write the preorder traversal of the tree. 
(e) Write the postorder traversal of the tree. 
(f) Write the inorder traversal of the tree.

Quizplus · Accepted Answer

The Answer of (a) Set up a binary tree for the following list, in the given order, using alphabetical ordering: STOP, LET, THERE, TAPE, NONE, YOU, ANT, NINE, OAT, NUT. 
(b) Explain step by step how you would search for the word TEST in your tree. 
(c) What is the height of the shortest binary search tree that can hold all 10 words? 
(d) Write the preorder traversal of the tree. 
(e) Write the postorder traversal of the tree. 
(f) Write the inorder traversal of the tree.

(A) Set Up a Binary Tree for the Following List