-
-
Notifications
You must be signed in to change notification settings - Fork 11
/
Max_Sum_Path.cpp
81 lines (66 loc) · 1.64 KB
/
Max_Sum_Path.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
#include<iostream>
#include<climits>
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);
}
int solve(Node* root, int &ans)
{
if(root==NULL)
{
return 0;
}
if(root->right==NULL && root->left==NULL) // leaf node
{
ans = max(ans, root->data);
return root->data;
}
int leftans = solve(root->left, ans);
int rightans = solve(root->right, ans);
int nodemax = max(max(root->data, root->data+leftans+rightans),
max(root->data+leftans, root->data+rightans));
ans = max(ans, nodemax);
int singlePathSum = max(root->data, max(root->data+leftans, root->data+rightans));
return singlePathSum;
}
int MaxSumPath(Node* root)
{
int ans = INT_MIN;
solve(root, ans);
return ans;
}
int main()
{
Node* root = new Node(1);
root->left = new Node(2);
root->left->left = new Node(4);
root->right = new Node(3);
root->right->right = new Node(5);
// root->right->right = new Node(-6);
cout<<MaxSumPath(root)<<endl;
return 0;
}