Example #1
0
 def test_1_null_2_returns_1_2(self):
     a_root = TreeNode(1)
     a_root.right = TreeNode(2)
     observed = Solution().preorder_traversal(a_root)
     self.assertEqual(observed, [
         1,
         2,
     ])
Example #2
0
 def test_only_left_children_size_5_returns(self):
     expected = list(range(0, 26, 5))
     nodes = list(TreeNode(i) for i in expected)
     i = 0
     while i < len(nodes) - 1:
         nodes[i].left = nodes[i + 1]
         i += 1
     observed = Solution().preorder_traversal(nodes[0])
     self.assertEqual(expected, observed)
Example #3
0
    def setUp(self):
        self.root = TreeNode(0)
        self.node1 = TreeNode(1)
        self.node2 = TreeNode(2)
        self.node3 = TreeNode(3)
        self.node4 = TreeNode(4)
        self.node5 = TreeNode(5)
        self.node5 = TreeNode(5)
        self.node6 = TreeNode(6)
        self.root.left = self.node1
        self.root.right = self.node2
        self.node1.left = self.node3
        self.node1.right = self.node4
        self.node2.left = self.node5
        self.node2.right = self.node6

        s = Solution()
        s.mylist = []
        self.correct_answer = s.preorder(self.root)
Example #4
0
 def test_1null23_returns_123(self):
     expected = [
         1,
         2,
         3,
     ]
     nodes = list(map(lambda i: TreeNode(i), expected))
     nodes[0].right = nodes[1]
     nodes[1].left = nodes[-1]
     observed = Solution().preorder_traversal(nodes[0])
     self.assertEqual(observed, expected)
Example #5
0
 def test_3_1_2_returns_3_1_2(self):
     expected = [
         3,
         1,
         2,
     ]
     a_root = TreeNode(3)
     a_root.left = TreeNode(1)
     a_root.right = TreeNode(2)
     observed = Solution().preorder_traversal(a_root)
     self.assertEqual(observed, expected)
Example #6
0
 def test_1_2_returns_1_2(self):
     nodes = list(TreeNode(i) for i in range(1, 3))
     a_root = TreeNode(1)
     a_root.left = TreeNode(2)
     observed = Solution().preorder_traversal(a_root)
     self.assertEqual(observed, [1, 2])
Example #7
0
 def test_1_returns_1(self):
     observed = Solution().preorder_traversal(TreeNode(1))
     self.assertEqual(observed, [
         1,
     ])
Example #8
0
 def test_preorder_non_recusive3(self):
     #print "\n---------------------------------"
     #print "Preorder Non-recursive3"
     s = Solution()
     mylist = s.preorder_non_recursive3(self.root)
     self.assertEqual(mylist, self.correct_answer)
Example #9
0
 def test_preorder_non_recusive(self):
     s = Solution()
     mylist = s.preorder_non_recursive(self.root)
     self.assertEqual(mylist, self.correct_answer)