Skip to content

Instantly share code, notes, and snippets.

@Abhijeetd01

Abhijeetd01/PreorderInorderPostorder_CPP.cpp

Forked from mycodeschool/PreorderInorderPostorder_CPP.cpp
Created August 1, 2018 06:07
Show Gist options
  • Save Abhijeetd01/34b670a3ced6462a13e008e410c853be to your computer and use it in GitHub Desktop.
Save Abhijeetd01/34b670a3ced6462a13e008e410c853be to your computer and use it in GitHub Desktop.
Download ZIP

Revisions

  1. @mycodeschool mycodeschool revised this gist Apr 7, 2014. 1 changed file with 0 additions and 1 deletion.
    1 change: 0 additions & 1 deletion PreorderInorderPostorder_CPP.cpp
    View file
    Original file line number Diff line number Diff line change
    @@ -1,6 +1,5 @@
    /* Binary Tree Traversal - Preorder, Inorder, Postorder */
    #include<iostream>
    #include<queue>
    using namespace std;

    struct Node {
  2. @mycodeschool mycodeschool created this gist Apr 7, 2014.
    80 changes: 80 additions & 0 deletions PreorderInorderPostorder_CPP.cpp
    View file
    Original file line number Diff line number Diff line change
    @@ -0,0 +1,80 @@
    /* Binary Tree Traversal - Preorder, Inorder, Postorder */
    #include<iostream>
    #include<queue>
    using namespace std;

    struct Node {
    char data;
    struct Node *left;
    struct Node *right;
    };

    //Function to visit nodes in Preorder
    void Preorder(struct Node *root) {
    // base condition for recursion
    // if tree/sub-tree is empty, return and exit
    if(root == NULL) return;

    printf("%c ",root->data); // Print data
    Preorder(root->left); // Visit left subtree
    Preorder(root->right); // Visit right subtree
    }

    //Function to visit nodes in Inorder
    void Inorder(Node *root) {
    if(root == NULL) return;

    Inorder(root->left); //Visit left subtree
    printf("%c ",root->data); //Print data
    Inorder(root->right); // Visit right subtree
    }

    //Function to visit nodes in Postorder
    void Postorder(Node *root) {
    if(root == NULL) return;

    Postorder(root->left); // Visit left subtree
    Postorder(root->right); // Visit right subtree
    printf("%c ",root->data); // Print data
    }

    // Function to Insert Node in a Binary Search Tree
    Node* Insert(Node *root,char data) {
    if(root == NULL) {
    root = new Node();
    root->data = data;
    root->left = root->right = NULL;
    }
    else if(data <= root->data)
    root->left = Insert(root->left,data);
    else
    root->right = Insert(root->right,data);
    return root;
    }

    int main() {
    /*Code To Test the logic
    Creating an example tree
    M
    / \
    B Q
    / \ \
    A C Z
    */
    Node* root = NULL;
    root = Insert(root,'M'); root = Insert(root,'B');
    root = Insert(root,'Q'); root = Insert(root,'Z');
    root = Insert(root,'A'); root = Insert(root,'C');
    //Print Nodes in Preorder.
    cout<<"Preorder: ";
    Preorder(root);
    cout<<"\n";
    //Print Nodes in Inorder
    cout<<"Inorder: ";
    Inorder(root);
    cout<<"\n";
    //Print Nodes in Postorder
    cout<<"Postorder: ";
    Postorder(root);
    cout<<"\n";
    }