(Failed)_Binary_Tree_Level_Order_Traversal ||

CodingProgrammer · CodingProgrammer · commit 7e32d47b2da7 · 2017-12-24T13:43:00.000+08:00
diff --git a/107(Failed)_Binary_Tree_Level_Order_Traversal II.py b/107(Failed)_Binary_Tree_Level_Order_Traversal II.py
@@ -0,0 +1,24 @@
+# Definition for a binary tree node.
+# class TreeNode:
+#     def __init__(self, x):
+#         self.val = x
+#         self.left = None
+#         self.right = None
+
+class Solution:
+    def levelOrderBottom(self, root):
+        """
+        :type root: TreeNode
+        :rtype: List[List[int]]
+        """
+        ans = []
+        def bfs(root, level):
+            if root != None:
+                if len(ans) < level + 1:
+                    ans.append([])
+                ans[level].append(root.val)
+                bfs(root.left, level + 1)
+                bfs(root.right, level + 1)
+        bfs(root, 0)
+        ans.reverse()
+        return ans
