For this activity, either electronically or on paper draw a Binary Tree using the values below.

Note: Insert each value into the tree in the exact order from left to right following the procedure

discussed in chapter $21$ :

$25,14,7,32,27,2,29,9,35$

On a separate electronic page or sheet of paper:

List the values using in$-$order traversal

List the values using pre$-$order traversal

List the values using post$-$order traversal

See page $1264$ of the textbook for definitions of the traversal methods.

Submit the file in Canvas. There is no code associated with this class exercise.