TREE ORDER TRAVERSAL

 #include <iostream>

using namespace std;


class Tree {

    struct Node {

        string data; // Changed 'type' to 'string' to match the data being inserted

        Node* left;

        Node* right;

        

        Node(string d) : data(d), left(nullptr), right(nullptr) {}

    };


public:

    Node* root = nullptr;


    Tree() {

        Node* f = new Node("F");

        Node* g = new Node("G");

        Node* h = new Node("H");

        f->left = g;

        f->right = h;

        root = f; // Corrected 'Root' to 'root'

    }


    void preorder(Node* ptr) {

        if (ptr != nullptr) {

            cout << ptr->data << " ";

            preorder(ptr->left);

            preorder(ptr->right); // Corrected 'ptr-right' to 'ptr->right'

        }

    }


    void inorder(Node* ptr) {

        if (ptr != nullptr) {

            inorder(ptr->left);

            cout << ptr->data << " ";

            inorder(ptr->right); // Corrected 'ptr-right' to 'ptr->right'

        }

    }


    void postorder(Node* ptr) {

        if (ptr != nullptr) {

            postorder(ptr->left);

            postorder(ptr->right); // Corrected 'ptr-right' to 'ptr->right'

            cout << ptr->data << " ";

        }

    }

};


int main() {

    Tree obj;

    cout << "Preorder Traversal: ";

    obj.preorder(obj.root);

    cout << endl;

    

    cout << "Inorder Traversal: ";

    obj.inorder(obj.root);

    cout << endl;

    

    cout << "Postorder Traversal: ";

    obj.postorder(obj.root);

    cout << endl;


    return 0;

}


Comments

Post a Comment

Popular posts from this blog

LIST ADT USING LINKED LIST

 #include <iostream> using namespace std; struct Node {     int data;     Node* next; }; Node* head = nullptr; void insert() {     int value;     cout << "\nEnter the element to insert: ";     cin >> value;     Node* newNode = new Node{value, nullptr};     if (!head) {         head = newNode;     } else {         newNode->next = head;         head = newNode;     } } void display() {     if (!head) {         cout << "\nList is empty\n";         return;     }     Node* temp = head;     cout << "\nList elements:\n";     while (temp) {         cout << temp->data << " ";         temp = temp->next;     }     cout << "\n"; } int main() { ...
Read more

CLASSES CREATION

  #include <iostream> using namespace std; class sample   //class creation { public: static int a; // datatype static void data() { cout<<"i am the best"; } //function }; int sample::a=10; //declaring datatype int main() { cout<<sample::a<<"\n";    //printing data sample::data();    //printing function without return type return 0; }
Read more

SORTING PROGRAM

 #include <iostream> using namespace std; int main() {     int n[5], i, num_elements;     cout << "Enter the number of elements (up to 3): ";     cin >> num_elements;     if (num_elements > 3) {         cout << "Number of elements exceeds the limit of 3." << end;         return 1;     }     cout << "Enter " << num_elements << " elements:" << endl;     for (i = 0; i < num_elements; i++) {         cin >> n[i];     }     int temp, j;     for (i = 1; i < num_elements; i++) {         j = i;         while (j > 0 && n[j] < n[j - 1]) {             temp = n[j];             n[j] = n[j - 1];             n[j - 1] = temp;  ...
Read more