Scribd Logo
Upload

Welcome to Scribd!

  • 322 views

    CS301p Assignment 2 Solution Spring 2023

    Uploaded by

    Hunzala Ahmad
    This document contains C++ code that defines a binary tree class with methods for inserting nodes and performing in-order, pre-order, and post-order tree traversals. It then creates a sample binary tree, inserts nodes into it, and uses the traversal methods to output the nodes in reverse order.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    CS301p Assignment 2 Solution Spring 2023

    Uploaded by

    Hunzala Ahmad
    322 views3 pages
    This document contains C++ code that defines a binary tree class with methods for inserting nodes and performing in-order, pre-order, and post-order tree traversals. It then creates a sample binary tree, inserts nodes into it, and uses the traversal methods to output the nodes in reverse order.

    Original Description:

    cs301p

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document contains C++ code that defines a binary tree class with methods for inserting nodes and performing in-order, pre-order, and post-order tree traversals. It then creates a sample binary tree, inserts nodes into it, and uses the traversal methods to output the nodes in reverse order.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    322 views3 pages

    CS301p Assignment 2 Solution Spring 2023

    Uploaded by

    Hunzala Ahmad
    This document contains C++ code that defines a binary tree class with methods for inserting nodes and performing in-order, pre-order, and post-order tree traversals. It then creates a sample binary tree, inserts nodes into it, and uses the traversal methods to output the nodes in reverse order.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    of 3

    CS301p Assignment 2 Solution

    #include <iostream>
    #include <stack>
    using namespace std;

    template <typename T>


    class TreeNode {
    public:
        T data;
        TreeNode<T>* left;
        TreeNode<T>* right;

        TreeNode(T data) {
            this->data = data;
            left = NULL;
            right = NULL;
        }

        void insert(T data) {


            if (data < this->data) {
                if (left == NULL) {
                    left = new TreeNode<T>(data);
                } else {
                    left->insert(data);
                }
            } else {
                if (right == NULL) {
                    right = new TreeNode<T>(data);
                } else {
                    right->insert(data);
                }
            }
        }

        void inOrder(stack<T> &s) {


            if (left != NULL) {
                left->inOrder(s);
            }
            s.push(data);
            if (right != NULL) {
                right->inOrder(s);
            }
        }

        void preOrder(stack<T> &s) {


            s.push(data);
            if (left != NULL) {
                left->preOrder(s);
            }
            if (right != NULL) {
                right->preOrder(s);
            }
        }

        void postOrder(stack<T> &s) {


            if (left != NULL) {
                left->postOrder(s);
            }
            if (right != NULL) {
                right->postOrder(s);
            }
            s.push(data);
        }
    };

    int main() {
        stack<int> s;
        TreeNode<int>* root = new TreeNode<int>(11);
        root->insert(6);
        root->insert(15);
        root->insert(4);
        root->insert(8);
        root->insert(13);
        root->insert(19);
        root->insert(16);

        cout << "Reverse Order of In-Order Travsersal" << endl;


        root->inOrder(s);
        while (!s.empty()) {
            cout << s.top() << endl;
            s.pop();
        }

        cout << "Reverse Order of Pre-Order Travsersal" << endl;


        root->preOrder(s);
        while (!s.empty()) {
            cout << s.top() << endl;
            s.pop();
        }

        cout << "Reverse Order of Post-Order Travsersal" << endl;


        root->postOrder(s);
        while (!s.empty()) {
            cout << s.top() << endl;
            s.pop();
        }
        return 0;
    }

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy