Algorithms/treetraversal.cpp at main · bindiyakhalasi/Algorithms · 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

#include <bits/stdc++.h>
using namespace std;


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

Node* newNode(int data)
{
    Node* temp = new Node;
    temp->data = data;
    temp->left = temp->right = NULL;
    return temp;
}


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

    printPostorder(node->left);


    printPostorder(node->right);


    cout << node->data << " ";
}

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


    cout << "\nPostorder traversal of binary tree is \n";
    printPostorder(root);

    return 0;
}