in c++ Consider the following sequence: 10, 32, 70, 15, 60, 5, 7, 23, 19 You have to perform dry runs in part 1 to 4: Represent it in the form of an array Perform breadth first traversal Perform...

in c++

Consider the following sequence:

10, 32, 70, 15, 60, 5, 7, 23, 19

You have to perform dry runs in part 1 to 4:

1. Represent it in the form of an array


2. Perform breadth first traversal


3. Perform Inorder, pre order and post order traversals


4. Delete the node 32, and re draw the tree after deletion


5. Implement the above to support your answers