Graph-Algorithms/Tree_DFS_traversal.cpp at main · Alen-Scaria1516/Graph-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
48
49
50
51
52
53
54
55

//Preorder Traversal for
class Solution {
    void Preorder(TreeNode *root,vector<int> &ans)
    {
        if(root==NULL)return;
        ans.push_back(root->val);
        Preorder(root->left,ans);
        Preorder(root->right,ans);
        return;
    }
public:
    vector<int> preorderTraversal(TreeNode* root) {
        vector<int> ans;
        Preorder(root,ans);
        return ans;
    }
};
//Inorder traversal
class Solution {
    void Inorder(TreeNode *root,vector<int>&ans)
    {
        if(root==NULL) return;
        Inorder(root->left,ans);
        ans.push_back(root->val);
        Inorder(root->right,ans);
        return;

    }
public:
    vector<int> inorderTraversal(TreeNode* root) {
        vector<int> ans(0);
        Inorder(root,ans);
        return ans;
    }
};

//Preorder traversalclass Solution {
    void PostOrder(TreeNode *root,vector<int>&ans)
    {
        if(root==NULL) return;
        PostOrder(root->left,ans);
        PostOrder(root->right,ans);
        ans.push_back(root->val);
        return;

    }
public:
    vector<int> postorderTraversal(TreeNode* root) {
        vector<int> ans(0);
        PostOrder(root,ans);
        return ans;
    }
};
//Submissions made on Leetcode