1. In order Traversal

2. Post Order Traversal

3. Pre Order Traversal

4. Number of Leaf Nodes

5. Level of the Above Tree

6. Inner nodes for the left subtree from root

7. successor of 14 in tree and Predecessor of 6 in tree

Q2:

Mention the Steps to insert a specific node in a tree

Q3:

Write steps and Also develop a C++ program to search a node in a tree

Challenge yourself:

Q4:

1. Write steps and Code for conversion to Post order if in order traversal is given.

2. Delete nodes level by level starting from the bottom

3. print only those nodes which are least greater in both subtrees

Q1: Given a tree answer the following: 1. In order Traversal 2. Post Order Traversal 3. Pre Order Traversal 4. Number of Leaf Nodes 5. Level of the Above Tree 6. Inner nodes for the left subtree from root 7. successor of 14 in tree and Predecessor of 6 in tree Q2: Mention the Steps to insert a specific node in a tree Q3: Write steps and Also develop a C++ program to search a node in a tree