github/All_Traversal.cpp at main · Pallavi960/github · 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
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
#include<iostream>
#include<vector>
#include<stack>

using namespace std;
struct Node{
    int data;
    Node* left;
    Node* right;
    Node(int val)
    {
        data=val;
        left=right=NULL;
    }
};


void print(vector<int>nums)
{
    for(int i=0;i<nums.size();i++)
    cout<<nums[i]<<" ";
    cout<<endl;
}


void Traverse(Node* root)
{
    vector<int>Preorder;
    vector<int>Postorder;
    vector<int>Inorder;

    if(root==NULL)return ;
    stack<pair<Node*,int>>st;
    st.push({root,1});
    while(!st.empty())
    {
        auto it=st.top();
        st.pop();
        if(it.second==1)//preorder
        {
            Preorder.push_back(it.first->data);
            it.second++;
            st.push(it);
            Node* temp=it.first;
            if(temp->left!=NULL)st.push({temp->left,1});
            //goto left
        }
        else if(it.second==2)//inorder
        {
            Inorder.push_back(it.first->data);
            it.second++;
            st.push(it);
            Node* temp=it.first;
            if(temp->right!=NULL)st.push({temp->right,1});
        }
        else{
            Postorder.push_back(it.first->data);
        }

    }
    cout<<"Preorder:";print(Preorder);
    cout<<"Postorder:";print(Postorder);
    cout<<"Inorder:";print(Inorder);

}


int main()
{
    Node * root=new Node(1);//

    root->left=new Node(2);
    root->left->right=new Node(3);
    root->left->left=new Node(4);

    root->right=new Node(5);
    root->right->left=new Node(6);
    root->right->right=new Node(7);


    Traverse(root);
    return 0;
}
 /*1  2  4  3  5  6  7

       In order Traversal: 4  2  3  1  6  5  7

     Post order Traversal: 4  3  2  6  7  5  1*/