Tree-Questions/inorder.cpp at main · subhradeepnag/Tree-Questions · 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
#include<bits/stdc++.h>
using namespace std;

struct Node
{
    int data;
    Node*left;
    Node*right;
    Node(int data)
    {
        this->data = data;
        left = right = NULL;
    }
};

void inOrder(struct Node*root)
{
    stack<Node*>stk;
    Node*curr = root;

    while(curr!=NULL || stk.empty()==false)
    {
        if(curr!=NULL)
        {
            stk.push(curr);
            curr = curr->left;
        }
        else
        {
            curr = stk.top();
            stk.pop();
            cout<<curr->data<<" "<<flush;
            curr = curr->right;
        }

    }
}

int main()
{
    struct Node *root = new Node(1);
    root->left        = new Node(2);
    root->right       = new Node(3);
    root->left->left  = new Node(4);
    root->left->right = new Node(5);

    inOrder(root);
    return 0;
}