1. Using the binary search tree, write the sequence of nodes visited in a. In order traversal b. Preorder traversal c. Post order traversa 2. Design and implement your own version of a binary tree ADT...

1. Using the binary search tree, write the sequence of nodes visited in

a. In order traversal

b. Preorder traversal

c. Post order traversa

2. Design and implement your own version of a binary tree ADT that stores numbers.

3. Extend the previous design to write a class template that creates a binary tree for storing values of any data type.