def test_postorder(): bst = BinarySearchTree() rbt = RedBlackTree() data = gen_random_u_array(10) for d in data: bst.insert(d) rbt.insert(d) assert np.array_equal(bst.postorder(), rbt.postorder()) is False
def test_postorder(): """Successfully returns an array of postordered values from a binary tree""" tree = BinarySearchTree() tree.add('D') tree.add('B') tree.add('A') tree.add('C') tree.add('F') tree.add('E') assert tree.postorder() == ['A', 'C', 'B', 'E', 'F', 'D']
def test_postorder(): """Successfully returns an empty array from an empty binary tree""" tree = BinarySearchTree() assert tree.postorder() == []