tree-notes/26rootToNodePath.cpp at main · coder-writes/tree-notes · 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>
usingnamespacestd;
structTreeNode
{
int data;
structTreeNode* left;
structTreeNode* right;

TreeNode(int val)
 {
 data = val;
 left = NULL;
 right = NULL;
 }

};
boolhelper(TreeNode* root,int A,vector<int> &arr){
if(root==NULL){
returnfalse;
 }

 arr.push_back(root->data);
if(root->data==A){
returntrue;
 }

if(helper(root->left,A,arr) || helper(root->right,A,arr))
returntrue;

 arr.pop_back();
returnfalse;
}
vector<int> rootToNodePath(TreeNode* root,int A){
 vector<int>arr;
if(root==NULL){
return arr;
 }
helper(root,A,arr);
return arr;
}
intmain(){
structTreeNode* root = newTreeNode(2);
 root->left = newTreeNode(5);
 root->left->left = newTreeNode(4);
 root->left->left->left = newTreeNode(3);
 root->left->left->right = newTreeNode(2);
 root->left->right = newTreeNode(5);
 root->right = newTreeNode(7);
 root->right->left = newTreeNode(9);
 root->right->left->right = newTreeNode(2);
 root->right->left->right->right = newTreeNode(4);
 root->right->left->right->left = newTreeNode(1);
 root->right->left->left = newTreeNode(3);
 root->right->right = newTreeNode(7);

for(auto &val: rootToNodePath(root,1)){
 cout<<val<<"";

 }


}