1145_Binary_Tree_Coloring_Game

Author: Partho Biswas

README.md

@@ -334,6 +334,7 @@ Check this [golden](https://tinyurl.com/ujopecz) post.
 |23| [543. Diameter of Binary Tree](https://tinyurl.com/womnj8m) | [Python](https://tinyurl.com/wu6rdaw/543_Diameter_of_Binary_Tree.py)| [Educative.io](https://tinyurl.com/w6rrucg), [Art 1](https://tinyurl.com/vfnvg8q) | Medium | 📌 Important |
 |24| **[1110. Delete Nodes And Return Forest](https://tinyurl.com/rg8qomj)** | [Python](https://tinyurl.com/wu6rdaw/1110_Delete_Nodes_And_Return_Forest.py)| [Vid 1](https://tinyurl.com/t9rax3x), [Vid 2](https://tinyurl.com/uw6y3zk), [Art 1](https://tinyurl.com/ujopecz), [Art 2](https://tinyurl.com/tppglsu) | Medium | 📌 **TODO: Check again. Important |
 |25| [257. Binary Tree Paths](https://leetcode.com/problems/binary-tree-paths/)| [Python](https://tinyurl.com/wu6rdaw/257_Binary_Tree_Paths.py)| --- | Easy | DFS |
+|26| **[1145. Binary Tree Coloring Game](https://tinyurl.com/uukf2nm)**| [Python](https://tinyurl.com/wu6rdaw/1145_Binary_Tree_Coloring_Game.py)| [Art 1](https://tinyurl.com/v4k7jaj), [Art 2](https://tinyurl.com/rvwsjar) | Medium | DFS |
 
 </p>
 </details>

leetcode.com/python/1145_Binary_Tree_Coloring_Game.py

@@ -0,0 +1,40 @@
+# Definition for a binary tree node.
+# class TreeNode(object):
+#     def __init__(self, x):
+#         self.val = x
+#         self.left = None
+#         self.right = None
+
+class Solution(object):
+    def findNode(self, nodeVal, root):
+        if not root:
+            return None
+        if root.val == nodeVal:
+            return root
+        left = self.findNode(nodeVal, root.left)
+        if left:
+            return left
+        else:
+            return self.findNode(nodeVal, root.right)
+
+    def countNode(self, root):
+        if not root:
+            return 0
+        leftCount = self.countNode(root.left)
+        rightCount = self.countNode(root.right)
+        return leftCount + rightCount + 1
+
+    def btreeGameWinningMove(self, root, n, x):
+        """
+        :type root: TreeNode
+        :type n: int
+        :type x: int
+        :rtype: bool
+        """
+        xNode = self.findNode(x, root)
+        xNodeLeftCount = self.countNode(xNode.left)
+        xNodeRightCount = self.countNode(xNode.right)
+        xNodeParentCount = n - xNodeLeftCount - xNodeRightCount - 1
+        return any([xNodeParentCount > xNodeLeftCount + xNodeRightCount,
+                    xNodeLeftCount > xNodeRightCount + xNodeParentCount,
+                    xNodeRightCount > xNodeLeftCount + xNodeParentCount])