Exemplos de convert_binary_tree_to_list em Python

Exemplo n.º 1

 def test_solution(self):
     self.assertEqual([4, 5, 2, None, None, 3, 1],
                      common.convert_binary_tree_to_list(
                          Solution().upsideDownBinaryTree(
                              common.create_binary_tree([1, 2, 3, 4, 5]))))
     self.assertEqual([4, None, 2, 3, 1],
                      common.convert_binary_tree_to_list(
                          Solution().upsideDownBinaryTree(
                              common.create_binary_tree([1, 2, 3, 4]))))

Exemplo n.º 2

    def test_solution(self):
        tree = common.create_binary_tree([1, 3, None, None, 2])
        Solution().recoverTree(tree)
        self.assertEqual(
            [3, 1, None, None, 2],
            common.convert_binary_tree_to_list(tree))

        tree = common.create_binary_tree([3, 1, 4, None, None, 2])
        Solution().recoverTree(tree)
        self.assertEqual(
            [2, 1, 4, None, None, 3],
            common.convert_binary_tree_to_list(tree))

Exemplo n.º 3

Arquivo: test_l0095_unique_binary_search_trees_2.py Projeto: sprax/1337

 def test_solution(self):
     self.assertEqual(
         sorted([[1, None, 3, 2], [3, 2, None, 1], [3, 1, None, None, 2],
                 [2, 1, 3], [1, None, 2, None, 3]]),
         sorted([
             common.convert_binary_tree_to_list(t)
             for t in Solution().generateTrees(3)
         ]))
     self.assertEqual(
         sorted([]),
         sorted([
             common.convert_binary_tree_to_list(t)
             for t in Solution().generateTrees(0)
         ]))

Exemplo n.º 4

Arquivo: test_l0297_serialize_and_deserialize_binary_tree.py Projeto: sprax/1337

 def test_solution(self):
     codec = Codec()
     root = common.create_binary_tree([1, 2, 3, None, None, 4, 5])
     self.assertEqual([1, 2, 3, None, None, 4, 5],
                      common.convert_binary_tree_to_list(
                          codec.deserialize(codec.serialize(root))))

Exemplo n.º 5

Arquivo: test_l0105_construct_binary_tree_from_preorde_and_inorder_traversal.py Projeto: sprax/1337

 def test_solution(self):
     self.assertEqual([3, 9, 20, None, None, 15, 7],
                      common.convert_binary_tree_to_list(
                          Solution().buildTree([3, 9, 20, 15, 7],
                                               [9, 3, 15, 20, 7])))

Exemplo n.º 6

 def test_solution(self):
     self.assertEqual([0, -3, 9, -10, None, 5],
                      common.convert_binary_tree_to_list(
                          Solution().sortedArrayToBST([-10, -3, 0, 5, 9])))

Exemplo n.º 7

Arquivo: test_l0226_invert_binary_tree.py Projeto: sprax/1337

 def test_solution(self):
     self.assertEqual(
         [4, 7, 2, 9, 6, 3, 1],
         common.convert_binary_tree_to_list(Solution().invertTree(
             common.create_binary_tree([4, 2, 7, 1, 3, 6, 9]))))

Exemplo n.º 8

 def test_solution(self):
     tree = common.create_binary_tree([1, 2, 5, 3, 4, None, 6])
     Solution().flatten(tree)
     self.assertEqual([1, None, 2, None, 3, None, 4, None, 5, None, 6],
                      common.convert_binary_tree_to_list(tree))