-
-
Notifications
You must be signed in to change notification settings - Fork 10
/
K_Sum_Paths.cpp
82 lines (64 loc) · 1.36 KB
/
K_Sum_Paths.cpp
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
#include<iostream>
#include<vector>
using namespace std;
class Node{
public:
int data;
Node* left;
Node* right;
Node(int val)
{
data = val;
left = NULL;
right = NULL;
}
};
void printBT(const std::string& prefix, const Node* node, bool isLeft)
{
if (node != nullptr)
{
std::cout << prefix;
std::cout << (isLeft ? "|--" : "L--");
std::cout << node->data << std::endl;
printBT(prefix + (isLeft ? "| " : " "), node->right, true);
printBT(prefix + (isLeft ? "| " : " "), node->left, false);
}
}
void printBT(const Node* node)
{
printBT("", node, false);
}
void solve(Node* root, int k, int &count, vector<int> &path)
{
if(root==NULL)
{
return;
}
path.push_back(root->data);
solve(root->left, k, count, path);
solve(root->right, k, count, path);
int size = path.size();
int sum=0;
for(int i=size-1; i>=0; i--)
{
sum+=path[i];
if(sum==k)
count++;
}
path.pop_back();
}
int KSumPath(Node* root, int k)
{
int count = 0;
vector<int> path;
solve(root, k, count, path);
return count;
}
int main()
{
Node* root = new Node(1);
root->left = new Node(1);
root->right = new Node(1);
cout<<KSumPath(root, 2);
return 0;
}