def test(self):
# p = TreeNode(23)
# p.left = TreeNode(14)
# p.right = TreeNode(67)
# p.left.left = TreeNode(12)
# p.left.right = TreeNode(17)
# p.left.left.left = TreeNode(9)
# p.left.right.right = TreeNode(19)
# p.right.left = TreeNode(54)
# p.right.right = TreeNode(72)
# p.right.left.left = TreeNode(50)
# p.right.right.right = TreeNode(76)
p = Solution().sortedArrayToBST([9, 12, 14, 17, 19, 23, 50, 54, 67, 72, 76])
bt = BinaryTree()
bt.root = p
self.assertListEqual([23, 14, 67, 12, 19, 54, 76, 9, 17, 50, 72], bt.bfs())
def test(self):
linked_list = create_linked_list([-10, -3, 0, 5, 9])
t = Solution().sortedListToBST(linked_list)
bt = BinaryTree()
bt.root = t
self.assertListEqual([0, -10, 5, -3, 9], bt.bfs())
# print(a_node.value) # a
# print(b_node.value) # b
# print(c_node.value) # c
# print(d_node.value) # d
# print(e_node.value) # e
# print(f_node.value) # f
#
#
node_1 = BinaryTree('1')
node_1.insert_left('2')
node_1.insert_right('5')
node_2 = node_1.left_child
node_2.insert_left('3')
node_2.insert_right('4')
node_5 = node_1.right_child
node_5.insert_left('6')
node_5.insert_right('7')
# print("In Order Display ")
# node_1.in_order();
# print("Pre Order Display ")
# node_1.pre_order();
#
# print("Post Order Display ")
# node_1.post_order();
node_1.bfs();
def test_bfs_empty_tree():
tree = BinaryTree()
result = list(tree.bfs())
assert len(result) == 0
f_node = c_node.right
print(tree1.data) # a
print(b_node.data) # b
print(c_node.data) # c
print(d_node.data) # d
print(e_node.data) # e
print(f_node.data) # f
tree2 = BinaryTree(1)
tree2.insert_left(2)
tree2.left.insert_left(3)
tree2.left.insert_right(4)
tree2.insert_right(5)
tree2.right.insert_left(6)
tree2.right.insert_right(7)
print("Preorder traversal: ", end='')
tree2.pre_order()
print("\nInorder traversal: ", end='')
tree2.in_order()
print("\nPostorder traversal: ", end='')
tree2.post_order()
print("\nBFS traversal: ", end='')
tree2.bfs()
