projects_cpp/inorder_preorder_postorder.cpp at master · adityeah8969/projects_cpp · 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
#include<bits/stdc++.h>
using namespace std;

#define ll long long int

class node{

    public:
        int data;
        node* left;
        node* right;

        node(int val){
            this->data = val;
            this->left = NULL;
            this->right = NULL;
        }
};


void preorder(node* root){
    if(root==NULL){return;}
    cout<<root->data<<" ";
    preorder(root->left);
    preorder(root->right);
    return;
}

void inorder(node* root){
    if(root==NULL){return;}
    inorder(root->left);
    cout<<root->data<<" ";
    inorder(root->right);
    return;
}

void postorder(node* root){
    if(root==NULL){return;}
    postorder(root->left);
    postorder(root->right);
    cout<<root->data<<" ";
    return;
}

int main(){

    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);

    cout<<"preorder: ";
    preorder(root);
    cout<<"\n";

    cout<<"inorder: ";
    inorder(root);
    cout<<"\n";

    cout<<"postorder: ";
    postorder(root);
    cout<<"\n";

    return 0;
}