| Line 1: | Line 1: | ||
| − | + | <br> | |
| − | =Binary Tree: In Order and Post Order= | + | = Binary Tree: In Order and Post Order = |
| + | '''In Order Printing''' | ||
| + | In order printing takes the root of a binary tree and prints all the values in the tree in order. The function is a recursive function that goes as far left in the binary tree until it hits the end. It will then print the leaf's value. After the leaf's value is printed, the function moves to the right once and precedes to go left until a leaf is found. Printing the leaf's value and continues on. | ||
| − | + | Example code for in order printing: | |
| + | void Tree_inOrder(TNode *n) /*see declaration of TNode below*/ | ||
| + | { | ||
| + | if(n==0) | ||
| − | [[ ECE264|Back to ECE264]] | + | return; |
| + | |||
| + | Tree_inOrder(n->left); | ||
| + | |||
| + | printf("%d\n", n->value); | ||
| + | |||
| + | Tree_inOrder(n->right); | ||
| + | |||
| + | } | ||
| + | |||
| + | <br> | ||
| + | |||
| + | void Tree_postOrder(TNode *n) /*see declaration of TNode below*/ | ||
| + | |||
| + | { | ||
| + | |||
| + | if(n==0) | ||
| + | |||
| + | return; | ||
| + | |||
| + | Tree_postOrder(n->left); | ||
| + | |||
| + | Tree_postOrder(n->right); | ||
| + | |||
| + | printf("%d\n", n->value); | ||
| + | |||
| + | } | ||
| + | |||
| + | |||
| + | |||
| + | |||
| + | |||
| + | |||
| + | |||
| + | The declaration of TNode is as followed: | ||
| + | |||
| + | typedef struct Treenode | ||
| + | |||
| + | { | ||
| + | |||
| + | int value; | ||
| + | |||
| + | struct Treenode *left; | ||
| + | |||
| + | struct Treenode *right; | ||
| + | |||
| + | }TNode; | ||
| + | |||
| + | <br> [[ECE264|Back to ECE264]] | ||
| + | |||
| + | [[Category:ECE264]] | ||
Revision as of 17:11, 28 April 2011
Binary Tree: In Order and Post Order
In Order Printing In order printing takes the root of a binary tree and prints all the values in the tree in order. The function is a recursive function that goes as far left in the binary tree until it hits the end. It will then print the leaf's value. After the leaf's value is printed, the function moves to the right once and precedes to go left until a leaf is found. Printing the leaf's value and continues on.
Example code for in order printing:
void Tree_inOrder(TNode *n) /*see declaration of TNode below*/
{
if(n==0)
return;
Tree_inOrder(n->left);
printf("%d\n", n->value);
Tree_inOrder(n->right);
}
void Tree_postOrder(TNode *n) /*see declaration of TNode below*/
{
if(n==0)
return;
Tree_postOrder(n->left);
Tree_postOrder(n->right);
printf("%d\n", n->value);
}
The declaration of TNode is as followed:
typedef struct Treenode
{
int value;
struct Treenode *left;
struct Treenode *right;
}TNode;
