mirror of https://github.com/TheAlgorithms/C
45 lines
975 B
C
45 lines
975 B
C
/* Includes the functions for Recursive Traversals
|
|
of a Binary Tree. It is assumed that nodes and
|
|
tree have been created as per create_node.c
|
|
*/
|
|
|
|
#include <stdio.h>
|
|
|
|
void inOrderTraversal(struct node *node)
|
|
{
|
|
if (node == NULL) // if tree is empty
|
|
return;
|
|
|
|
inOrderTraversal(node->leftNode);
|
|
printf("\t%d\t", node->data);
|
|
inOrderTraversal(node->rightNode);
|
|
}
|
|
|
|
void preOrderTraversal(struct node *node)
|
|
{
|
|
if (node == NULL) // if tree is empty
|
|
return;
|
|
|
|
printf("\t%d\t", node->data);
|
|
preOrderTraversal(node->leftNode);
|
|
preOrderTraversal(node->rightNode);
|
|
}
|
|
|
|
void postOrderTraversal(struct node *node)
|
|
{
|
|
if (node == NULL) // if tree is empty
|
|
return;
|
|
|
|
postOrderTraversal(node->leftNode);
|
|
postOrderTraversal(node->rightNode);
|
|
printf("\t%d\t", node->data);
|
|
}
|
|
|
|
int main(void)
|
|
{
|
|
/* traversals can be done by simply invoking the
|
|
function with a pointer to the root node.
|
|
*/
|
|
|
|
return 0;
|
|
} |