Create main.cpp

Author: JawadSher

17 - Binary Tree Data Structure Problems/29 - Maximum Sum of Non-adjacent Nodes/main.cpp

@@ -0,0 +1,28 @@
+class Solution{
+  public:
+    pair<int, int> solve(Node* root){
+        if(root == NULL) {
+            pair<int, int> p = make_pair(0, 0);
+            return p;
+        };
+        
+        
+        pair<int, int> left = solve(root -> left);
+        pair<int, int> right = solve(root -> right);
+        
+        pair<int, int> res;
+        res.first = root -> data + left.second + right.second;
+        res.second = max(left.first, left.second) + max(right.first, right.second);
+        
+        
+        return res;
+        
+    }
+    //Function to return the maximum sum of non-adjacent nodes.
+    int getMaxSum(Node *root) 
+    {
+        pair<int, int> ans = solve(root);
+        return max(ans.first, ans.second);
+        
+    }
+};