dsa_final/binary_tree_use_linked_list.cpp at main · PrasadDhend/dsa_final · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
#include<iostream>
using namespace std;

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

class BinaryTree{

    public:
        Node* root;
        BinaryTree(){
            root = NULL;
        }

        void preOrderTraversal(Node* node){
            if (node == NULL)
            {
                return;
            }

            cout << node->data << " ";
            preOrderTraversal(node->left);
            preOrderTraversal(node->right);

        }

        void inOrderTraversal(Node* node){
            if(node == NULL)return;

            inOrderTraversal(node->left);
            cout<< node->data << " ";
            inOrderTraversal(node->right);
        }


        void postOrderTraversal(Node* node){
            if(node == NULL) return;

            postOrderTraversal(node->left);
            postOrderTraversal(node->right);
            cout << node->data << " ";
        }

};

int main(){

    BinaryTree binaryTree;

    binaryTree.root = new Node;

    binaryTree.root->data = 1;
    binaryTree.root->left = new Node;
    binaryTree.root->left->data = 2;
    binaryTree.root->left->left = NULL;
    binaryTree.root->left->right = NULL;
    binaryTree.root->right = new Node;
    binaryTree.root->right->data = 3;
    binaryTree.root->right->left = NULL;
    binaryTree.root->right->right = NULL;

    cout << endl << "------- Pre Order Traversal: -------" << endl;
    binaryTree.preOrderTraversal(binaryTree.root);

    cout << endl << "------- In Order Traversal ---------" << endl;
    binaryTree.inOrderTraversal(binaryTree.root);

    cout << endl << "------- Post Order Traversal -------" << endl;
    binaryTree.postOrderTraversal(binaryTree.root);

    return 0;
}