DSA/Q2.cpp at master · aniketshahi/DSA · 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
#include <iostream>
using namespace std;

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

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

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

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

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

int main()
{
    Node *root = newNode(1);
    root->left = newNode(2);
    root->right = newNode(3);
    root->left->left = newNode(4);
    root->left->right = newNode(5);
    cout << "Preorder traversal: ";
    dfs(root);
    cout << endl;
    cout << "Inorder traversal: ";
    dfs_inorder(root);
    cout << endl;
    cout << "Postorder traversal: ";
    dfs_postorder(root);
    cout << endl;
    return 0;
}