Leetcode-GFG-daily-2023/BinaryTree Boundary_Traversal at main · Glorycs29/Leetcode-GFG-daily-2023 · 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
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143


// it's super clean and clear code
// loved it


void boundaryLeft(Node* root,vector<int> &res)

    {

        if (!root) return;


        if (!root->left && !root->right)

        {

            return;

        }

        if (root->left)

        {

            res.push_back(root->data);

            boundaryLeft(root->left,res);

        }

        else if (root->right)

        {

            res.push_back(root->data);

            boundaryLeft(root->right,res);

        }

        return;

    }

    void boundaryBottom(Node* root,vector<int> &res)

    {

        if (!root)

        {

            return;

        }

        boundaryBottom(root->left,res);

        if(!root->left && !root->right)

        {

            res.push_back(root->data);

        }


        boundaryBottom(root->right,res);

    }

    void boundaryRight(Node* root,vector<int> &res)

    {

        if (!root) return;

        if (!root->left && !root->right)

        {

            return;

        }

        if (root->right)

        {
        //most important step
        //pehle function jaaega , triangle ki right boundary bottom right corner se hogi

            boundaryRight(root->right,res);

            res.push_back(root->data);

        }

        else if (root->left)

        {


            boundaryRight(root->left,res);

            res.push_back(root->data);

        }

    }

    vector <int> boundary(Node *root)

    {

        //Your code here

        vector<int> res;

        if (!root->left && !root->right)

        {

            res.push_back(root->data);

            return res;

        }

        res.push_back(root->data);

        boundaryLeft(root->left,res);

        boundaryBottom(root,res);

        boundaryRight(root->right,res);

        return res;

    }