C/C++ program for post,pre and inorder traversal of tree 

**Here, you have to work on three cases:**
First Case:
**At the beginning of the list**
Second Case:
**In the middle of the list**
Third Case:
**At the end of the list**
Also for time Complexity:
Big O notation:- **Worst-Case**
Theta notation:- **Average Case**
Omega notation: **Best Case**