From b84b8e71bf81fec0d005905eedffb8633417e481 Mon Sep 17 00:00:00 2001
From: Mohammad S Anwar <mohammad.anwar@yahoo.com>
Date: Fri, 13 Aug 2021 00:21:00 +0100
Subject: - Added guest contributions by Eric Cheung.

---
 challenge-125/eric-cheung/python/ch-2.py | 66 ++++++++++++++++++++++++++++++++
 1 file changed, 66 insertions(+)
 create mode 100644 challenge-125/eric-cheung/python/ch-2.py

(limited to 'challenge-125/eric-cheung/python')

diff --git a/challenge-125/eric-cheung/python/ch-2.py b/challenge-125/eric-cheung/python/ch-2.py
new file mode 100644
index 0000000000..a27a4673a6
--- /dev/null
+++ b/challenge-125/eric-cheung/python/ch-2.py
@@ -0,0 +1,66 @@
+## Python Program
+## Find Max. Path In Binary Tree
+## Credit And Reference: https://www.geeksforgeeks.org/find-maximum-path-sum-in-a-binary-tree/
+
+## A Binary Tree Node
+class Node:
+    ## Constructor to create a new node
+    def __init__(self, data):
+        self.data = data
+        self.left = None
+        self.right = None
+
+## This function returns overall max. path in 'res'
+## And returns max path count going through root
+def findMaxUtil(root):
+    ## Base Case
+    if root is None:
+        return 0
+
+    ## l and r store max. path count going through left
+    ## and right child of root respectively
+    l = findMaxUtil(root.left)
+    r = findMaxUtil(root.right)
+
+    ## Max path for parent call of root. This path
+    ## must include at most one child of root
+    max_single = max(max(l, r) + 1, 1)
+	
+    ## Max top represents the count when the node under
+    ## consideration is the root of the maxCount path and
+    ## no ancestor of root are there in max count path
+    max_top = max(max_single, l + r + 1)
+
+    ## Static variable to store the changes
+    ## Store the max. result
+    findMaxUtil.res = max(findMaxUtil.res, max_top)
+
+    return max_single
+
+## Return max. path count in tree with given root
+def findMaxCount(root):
+    ## Initialize result
+    findMaxUtil.res = float("-inf")
+	
+    ## Compute and return result
+    findMaxUtil(root)
+    return findMaxUtil.res - 1
+
+## Driver program
+root = Node(1)
+
+root.left = Node(2)
+root.right = Node(5);
+
+root.left.left = Node(3);
+root.left.right = Node(4);
+
+root.right.left = Node(6);
+root.right.right = Node(7);
+
+root.right.right.left = Node(8);
+root.right.right.right = Node(10);
+
+root.right.right.left.left = Node(9);
+
+print "Binary Tree Diameter is ", findMaxCount(root);
-- 
cgit