def test_tree_inorder():
Binary_tree = BinaryTree()
Binary_tree.root = Node(6)
Binary_tree.root.right = Node(5)
Binary_tree.root.left = Node(-1)
Binary_tree.root.right.left = Node(7)
Binary_tree.root.left.left = Node(10)
Binary_tree.root.right.right = Node(3)
assert Binary_tree.inOrder() == [10, -1, 6, 7, 5, 3]
