Answer Happy

Q6. a) Write code to conduct Breadth First Traversal of a Binary
Search Tree. Especially
mention any data structures that aid you in this routine.
b) Write code to store values in a Binary Search Tree in a file in
such a way so that when the
values are read back in this order and added to an empty BSTree we
will get the original
BSTree. (You are not required to write the code that actually
writes to file)
c) Write code so that we can retrieve all values from a Binary
Search Tree in sorted order from
largest to smallest.
do in c++