Create find-nearest-right-node-in-binary-tree.py

Author: kamyu104

Python/find-nearest-right-node-in-binary-tree.py

@@ -0,0 +1,28 @@
+# Time:  O(n)
+# Space: O(w)
+
+# Definition for a binary tree node.
+class TreeNode(object):
+    def __init__(self, val=0, left=None, right=None):
+        pass
+
+
+class Solution(object):
+    def findNeartestRightNode(self, root, u):
+        """
+        :type root: TreeNode
+        :type u: TreeNode
+        :rtype: TreeNode
+        """
+        q = [root]
+        while q:
+            new_q = []
+            for i, node in enumerate(q):
+                if node == u:
+                    return q[i+1] if i+1 < len(q) else None
+                if node.left:
+                    new_q.append(node.left)
+                if node.right:
+                    new_q.append(node.right)
+            q = new_q
+        return None