Binary tree traversal - Preorder.txt

// https://www.youtube.com/watch?v=gm8DUJJhmY4 
// Binary tree traversal: Preorder, Inorder, Postorder
1. Visit root
2. Visit left sub tree
3. Visit right sub tree

struct Node {
    char data;
    Node *left;
    Node *right;
}
void Preorder(struct Node *root){
if(root == NULL) return;
printf("%c ", root->data);
Preorder(root->left);
Preorder(root->right);
}
void Inorder(struct Node *root){
if(root == NULL) return;
Preorder(root->left);
printf("%c ", root->data);
Preorder(root->right);
}
void Postorder(struct Node *root){
if(root == NULL) return;
Preorder(root->left);
Preorder(root->right);
printf("%c ", root->data);
}