Scribd Logo
Upload

Welcome to Scribd!

  • 7 views

    Pre in Post Order

    Uploaded by

    jainmanya1815
    The document contains 4 sections that present C++ programs to traverse a binary tree using preorder, inorder, postorder, and all 3 orders. The programs define a node struct with data and left/right pointers, create a sample tree with nodes 1-4, and implement recursive functions to traverse the tree and output the node data in the specified order.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    Pre in Post Order

    Uploaded by

    jainmanya1815
    7 views4 pages
    The document contains 4 sections that present C++ programs to traverse a binary tree using preorder, inorder, postorder, and all 3 orders. The programs define a node struct with data and left/right pointers, create a sample tree with nodes 1-4, and implement recursive functions to traverse the tree and output the node data in the specified order.

    Original Description:

    pre and post order tree DSA

    Original Title

    Pre in post order

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document contains 4 sections that present C++ programs to traverse a binary tree using preorder, inorder, postorder, and all 3 orders. The programs define a node struct with data and left/right pointers, create a sample tree with nodes 1-4, and implement recursive functions to traverse the tree and output the node data in the specified order.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as txt, pdf, or txt
    7 views4 pages

    Pre in Post Order

    Uploaded by

    jainmanya1815
    The document contains 4 sections that present C++ programs to traverse a binary tree using preorder, inorder, postorder, and all 3 orders. The programs define a node struct with data and left/right pointers, create a sample tree with nodes 1-4, and implement recursive functions to traverse the tree and output the node data in the specified order.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as txt, pdf, or txt
    of 4

    1.

    WAP Program traverse by Pre Order

    #include <iostream>

    using namespace std;

    struct node {
    int data;
    struct node *left;
    struct node *right;
    };

    struct node *newNode(int data) {


    struct node *node = (struct node *)malloc(sizeof(struct node));

    node->data = data;

    node->left = NULL;
    node->right = NULL;
    return (node);
    }
    void traversePreOrder(struct node *temp) {
    if (temp != NULL) {
    cout << " " << temp->data;
    traversePreOrder(temp->left);
    traversePreOrder(temp->right);
    }
    }

    int main() {
    struct node *root = newNode(1);
    root->left = newNode(2);
    root->right = newNode(3);
    root->left->left = newNode(4);

    cout << "preorder traversal: ";


    traversePreOrder(root);

    2. WAP Program traverse by in Order

    #include <iostream>

    using namespace std;

    struct node {
    int data;
    struct node *left;
    struct node *right;
    };

    struct node *newNode(int data) {


    struct node *node = (struct node *)malloc(sizeof(struct node));

    node->data = data;
    node->left = NULL;
    node->right = NULL;
    return (node);
    }

    void traverseInOrder(struct node *temp) {


    if (temp != NULL) {
    traverseInOrder(temp->left);
    cout << " " << temp->data;
    traverseInOrder(temp->right);
    }
    }

    int main() {
    struct node *root = newNode(1);
    root->left = newNode(2);
    root->right = newNode(3);
    root->left->left = newNode(4);

    cout << "\nInorder traversal: ";


    traverseInOrder(root);

    3. WAP Program traverse by Post Order

    #include <iostream>

    using namespace std;

    struct node {
    int data;
    struct node *left;
    struct node *right;
    };

    struct node *newNode(int data) {


    struct node *node = (struct node *)malloc(sizeof(struct node));

    node->data = data;

    node->left = NULL;
    node->right = NULL;
    return (node);
    }

    void traversePostOrder(struct node *temp) {


    if (temp != NULL) {
    traversePostOrder(temp->left);
    traversePostOrder(temp->right);
    cout << " " << temp->data;
    }
    }

    int main() {
    struct node *root = newNode(1);
    root->left = newNode(2);
    root->right = newNode(3);
    root->left->left = newNode(4);

    cout << "\nPostorder traversal: ";


    traversePostOrder(root);
    }

    4. WAP Program traverse by Pre,in,post Order

    #include <iostream>

    using namespace std;

    struct node {
    int data;
    struct node *left;
    struct node *right;
    };

    // New node creation


    struct node *newNode(int data) {
    struct node *node = (struct node *)malloc(sizeof(struct node));

    node->data = data;

    node->left = NULL;
    node->right = NULL;
    return (node);
    }

    // Traverse Preorder
    void traversePreOrder(struct node *temp) {
    if (temp != NULL) {
    cout << " " << temp->data;
    traversePreOrder(temp->left);
    traversePreOrder(temp->right);
    }
    }

    // Traverse Inorder
    void traverseInOrder(struct node *temp) {
    if (temp != NULL) {
    traverseInOrder(temp->left);
    cout << " " << temp->data;
    traverseInOrder(temp->right);
    }
    }
    // Traverse Postorder
    void traversePostOrder(struct node *temp) {
    if (temp != NULL) {
    traversePostOrder(temp->left);
    traversePostOrder(temp->right);
    cout << " " << temp->data;
    }
    }

    int main() {
    struct node *root = newNode(1);
    root->left = newNode(2);
    root->right = newNode(3);
    root->left->left = newNode(4);

    cout << "preorder traversal: ";


    traversePreOrder(root);
    cout << "\nInorder traversal: ";
    traverseInOrder(root);
    cout << "\nPostorder traversal: ";
    traversePostOrder(root);
    }

    You might also like