Jul 28

Pre Order Traversal of a Binary Tree in C

// pre order traversal
void preOrder(NodePtr node) {

if (node != NULL) {
printf(“%s “, node->data.word);
preOrder(node->left);
preOrder(node->right);
}

}