Python build_tree_node_from_list示例

示例#1

文件： 236_Lowest_Common_Ancestor_of_a_Binary_Tree.py 项目： maoyalu/leetcode

 def test2(self):
     root = build_tree_node_from_list(
         [3, 5, 1, 6, 2, 0, 8, None, None, 7, 4])
     p = build_tree_node_from_list([5, 6, 2, None, None, 7, 4])
     q = build_tree_node_from_list([4])
     answer = build_tree_node_from_list([5, 6, 2, None, None, 7, 4])
     self.assertEqual(solution(root, p, q), answer)

示例#2

 def test1(self):
     root = build_tree_node_from_list(
         [4, 1, 6, 0, 2, 5, 7, None, None, None, 3, None, None, None, 8])
     answer = build_tree_node_from_list([
         30, 36, 21, 36, 35, 26, 15, None, None, None, 33, None, None, None,
         8
     ])
     self.assertEqual(solution(root), answer)

示例#3

文件： 104_Maximum_Depth_of_Binary_Tree.py 项目： maoyalu/leetcode

 def test1(self):
     root = build_tree_node_from_list([3, 9, 20, None, None, 15, 7])
     answer = 3
     self.assertEqual(solution(root), answer)

示例#4

 def test1(self):
     root = build_tree_node_from_list([1,None,2,None,None,3])
     answer = [3,2,1]
     self.assertEqual(solution(root), answer)

示例#5

 def test1(self):
     sum = 22
     root = build_tree_node_from_list(
         [5, 4, 8, 11, None, 13, 4, 7, 2, None, None, None, None, None, 1])
     self.assertTrue(solution(root, sum))

示例#6

 def test2(self):
     root = build_tree_node_from_list([10, 5, 15, 3, 7, 13, 18, 1, None, 6])
     L = 6
     R = 10
     answer = 23
     self.assertEqual(solution(root, L, R), answer)

示例#7

 def test1(self):
     root = build_tree_node_from_list([10, 5, 15, 3, 7, None, 18])
     L = 7
     R = 15
     answer = 32
     self.assertEqual(solution(root, L, R), answer)

示例#8

文件： 106_Construct_Binary_Tree_from_Inorder_and_Postorder_Traversal.py 项目： maoyalu/leetcode

 def test1(self):
     inorder = [9,3,15,20,7]
     postorder = [9,15,7,20,3]
     root = build_tree_node_from_list([3, 9, 20, None, None, 15, 7])
     self.assertEqual(solution(inorder, postorder), root)

示例#9

 def test2(self):
     root = build_tree_node_from_list([1, 2, 2, None, 3, None, 3])
     self.assertFalse(solution(root))

示例#10

 def test1(self):
     root = build_tree_node_from_list([1, 2, 2, 3, 4, 4, 3])
     self.assertTrue(solution(root))

示例#11

文件： 637_Average_of_Levels_in_Binary_Tree.py 项目： maoyalu/leetcode

 def test2(self):
     tree = build_tree_node_from_list([3, 9, 20, 15, 7])
     answer = [3, 14.5, 11]
     self.assertEqual(solution(tree), answer)

示例#12

文件： 951_Flip_Equivalent_Binary_Trees.py 项目： maoyalu/leetcode

 def test1(self):
     root1 = build_tree_node_from_list(
         [1, 2, 3, 4, 5, 6, None, None, None, 7, 8])
     root2 = build_tree_node_from_list(
         [1, 3, 2, None, 6, 4, 5, None, None, None, None, None, None, 8, 7])
     self.assertTrue(solution(root1, root2))

示例#13

文件： 700_Search_in_a_Binary_Search_Tree.py 项目： maoyalu/leetcode

 def test2(self):
     root = build_tree_node_from_list([4, 2, 7, 1, 3])
     val = 5
     answer = None
     self.assertEqual(solution(root, val), answer)

示例#14

文件： 700_Search_in_a_Binary_Search_Tree.py 项目： maoyalu/leetcode

 def test1(self):
     root = build_tree_node_from_list([4, 2, 7, 1, 3])
     val = 2
     answer = build_tree_node_from_list([2, 1, 3])
     self.assertEqual(solution(root, val), answer)

示例#15

 def test1(self):
     preorder = [3, 9, 20, 15, 7]
     inorder = [9, 3, 15, 20, 7]
     root = build_tree_node_from_list([3, 9, 20, None, None, 15, 7])
     self.assertEqual(solution(preorder, inorder), root)

示例#16

文件： 617_Merge_Two_Binary_Trees.py 项目： maoyalu/leetcode

 def test1(self):
     t1 = build_tree_node_from_list([1, 3, 2, 5])
     t2 = build_tree_node_from_list([2, 1, 3, None, 4, None, 7])
     answer = build_tree_node_from_list([3, 4, 5, 5, 4, None, 7])
     self.assertEqual(solution(t1, t2), answer)