python: add problem 103 and unittest

Author: supercoderhawk

Python/sln_101_200/solution_101_110.py

@@ -55,6 +55,38 @@ def recursive_tree(level, node):
         recursive_tree(0, root)
         return results
 
+    def zigzagLevelOrder(self, root: TreeNode) -> List[List[int]]:
+        """
+        103
+        :param root:
+        :return:
+        """
+        if not root:
+            return []
+        node_list = [root]
+        next_node_list = []
+        zigzag_list = []
+        idx = 0
+
+        while node_list:
+            zigzag = []
+            for node in node_list:
+                if idx//2:
+                    zigzag.append(node.val)
+                else:
+                    zigzag.insert(0, node.val)
+                if node.left:
+                    next_node_list.append(node.left)
+                if node.right:
+                    next_node_list.append(node.right)
+
+            node_list = next_node_list
+            next_node_list = []
+            zigzag_list.append(zigzag)
+            idx += 1
+
+        return zigzag_list
+
     def maxDepth(self, root):
         """
         104
@@ -69,6 +101,13 @@ def maxDepth(self, root):
 
         return left_depth if left_depth > right_depth else right_depth
 
+    def levelOrderBottom(self, root: TreeNode) -> List[List[int]]:
+        """
+        107
+        :param root:
+        :return:
+        """
+
     def isBalanced(self, root: TreeNode) -> bool:
         """
         110

Python/sln_101_200/test_solution_101_110.py

@@ -1,6 +1,7 @@
 # -*- coding: utf-8 -*-
 from unittest import TestCase
 from sln_101_200.solution_101_110 import Solution_101_110, TreeNode
+from common_utils import build_binary_tree
 
 
 class TestSolution_101_110(TestCase):
@@ -21,3 +22,7 @@ def test_maxDepth(self):
         root.right = right_1
         depth = self.sln.maxDepth(root)
         self.assertEqual(depth, 4)
+
+    def test_zigzagLevelOrder(self):
+        tree = build_binary_tree([3, 9, 20, None, None, 15, 7])
+        self.assertEqual(self.sln.zigzagLevelOrder(tree), [[3], [20, 9], [15, 7]])