def test_define_left_and_right_nodes(self):
node = Node(2)
node.left = Node(1)
node.right = Node(3)
self.assertEqual(node.left.value, 1)
self.assertEqual(node.right.value, 3)
def test_binary_tree_children():
node_a = Node('A')
node_b = Node('B')
node_c = Node('C')
tree = BinaryTree(node_b)
tree.root.left = node_b
tree.root.right = node_c
assert tree.root.left.value == 'B'
assert tree.root.right.value == 'C'
def bn_tree_ub():
tree = BinaryTree()
a = Node('A')
b = Node('B')
c = Node('C')
d = Node('D')
tree.root = a
a.left = b
a.right = c
b.right = d
return tree
def bn_tree_b():
tree = BinaryTree()
a = Node('A')
b = Node('B')
c = Node('C')
d = Node('D')
e = Node('E')
f = Node('F')
g = Node('G')
tree.root = a
a.left = b
a.right = c
b.left = d
b.right = e
c.left = f
c.right = g
return tree
def bn_mixed_tree():
tree = BinaryTree()
a = Node(6)
b = Node(75)
c = Node(34)
d = Node(12)
e = Node(1)
f = Node(100)
tree.root = a
a.left = b
a.right = c
b.left = d
b.right = e
c.left = f
return tree
def bst_tree():
tree = BinarySearchTree()
a = Node(23)
b = Node(8)
c = Node(42)
d = Node(4)
e = Node(16)
f = Node(27)
tree.root = a
a.left = b
a.right = c
b.left = d
b.right = e
c.left = f
return tree
def bn2():
tree = BinaryTree()
root = Node("42")
node_100 = Node("100")
node_600 = Node("600")
node_15 = Node("15")
node_160 = Node("160")
node_200 = Node("200")
node_350 = Node("350")
node_125 = Node("125")
node_175 = Node("175")
node_4 = Node("4")
node_500 = Node("500")
tree.root = root
root.left = node_100
root.right = node_600
node_100.left = node_15
node_100.right = node_160
node_600.left = node_200
node_600.right = node_350
node_160.left = node_125
node_160.right = node_175
node_350.left = node_4
node_350.right = node_500
return tree
def bn1():
tree = BinaryTree()
root = Node("150")
node_100 = Node("100")
node_250 = Node("250")
node_75 = Node("75")
node_160 = Node("160")
node_200 = Node("200")
node_350 = Node("350")
node_125 = Node("125")
node_175 = Node("175")
node_300 = Node("300")
node_500 = Node("500")
tree.root = root
root.left = node_100
root.right = node_250
node_100.left = node_75
node_100.right = node_160
node_250.left = node_200
node_250.right = node_350
node_160.left = node_125
node_160.right = node_175
node_350.left = node_300
node_350.right = node_500
return tree
def test_binary_tree_root():
node = Node('A')
tree = BinaryTree(node)
actual = tree.root.value
expected = node.value
assert actual == expected
def test_define_a_node(self):
node = Node(1)
self.assertIsInstance(node, Node)
self.assertEqual(node.value, 1)
def test_define_a_left_node(self):
node = Node(2)
node.left = Node(1)
self.assertEqual(node.left.value, 1)
def test_define_a_right_node(self):
node = Node(1)
node.right = Node(2)
self.assertEqual(node.right.value, 2)