Coding_Notes/MaxPathSum_BT.cpp at main · Ayushhg/Coding_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
#include<iostream>
#include<bits/stdc++.h>
using namespace std;

struct Node{

    int data;
    struct Node* right;
    struct Node* left;

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

};

int maxPathSumUtil(Node* root,int &ans){
    if(root==NULL){
        return 0;
    }

    int left = maxPathSumUtil(root->left,ans);
    int right = maxPathSumUtil(root->right,ans);

    int nodeMax(max(max(root->data, root->data + left + right),max(root->data + left,root->data + right)));

    ans = max(ans,nodeMax);
    int singlePathSum = max(root->data,max(root->data +left,root->data +right));
    return singlePathSum;

}

int maxPathSum(Node* root){
    int ans = INT_MIN;
    maxPathSumUtil(root,ans);
    return ans;
}


int main(){

    Node *root = new Node(1);
    root->left = new Node(2);
    root->right = new Node(3);
    root->left->left = new Node(4);
    root->right->right = new Node(5);
    cout<<maxPathSum(root);

    return 0;
}