25_Traversing_Binary_Tree_Info.c

int main(int argc, char const *argv[])
{
/* 
#PREORDER
-Process the Root R
-Traverse Left Subtree of R in Preorder
-Traverse the right Subtree R in Preorder

#INORDER
-Traverse Left Subtree of R in inorder
-Process the Root R.
-Traverse The right subtree of R in Inorder

#POSTORDER
-Traverse Left subtree of R in postorder
-Traverse the right subtree of R in Postorder
-Process the Root R. 



*/
	return 0;
}