Traversal

Level Order Print

// Inorder Print

void print_inorder(Tnode *root)
{
if (root == NULL)
return;

print_inorder(root->left);
printf("%d ", root->data);
print_inorder(root->right);
}

// Preorder Print

void print_preorder(Tnode *root)
{
if (root == NULL)
return;

printf("%d ", root->data);
print_preorder(root->left);
print_preorder(root->right);
}

// Postorder Print

void print_postorder(Tnode *root)
{
if (root == NULL)
return;

print_postorder(root->left);
print_postorder(root->right);
printf("%d ", root->data);
}
[[/code]]

Tree Traversal

know preorder & inorder -> know postorder
know postorder & inorder -> know preorder
know preorder & postorder -> cannot know inorder