def test_red_black_tree_traversal(basic_tree):
"""Test red black tree traversal."""
tree = red_black_tree.RBTree()
for key, data in basic_tree:
tree.insert(key=key, data=data)
assert [item for item in tree.inorder_traverse()] == [
(1, "1"),
(4, "4"),
(7, "7"),
(11, "11"),
(15, "15"),
(20, "20"),
(22, "22"),
(23, "23"),
(24, "24"),
(30, "30"),
(34, "34"),
]
assert [item for item in tree.preorder_traverse()] == [
(20, "20"),
(7, "7"),
(4, "4"),
(1, "1"),
(11, "11"),
(15, "15"),
(23, "23"),
(22, "22"),
(30, "30"),
(24, "24"),
(34, "34"),
]
assert [item for item in tree.postorder_traverse()] == [
(1, "1"),
(4, "4"),
(15, "15"),
(11, "11"),
(7, "7"),
(22, "22"),
(24, "24"),
(34, "34"),
(30, "30"),
(23, "23"),
(20, "20"),
]
def test_simple_case(basic_tree):
"""Test the basic operations of a red black tree."""
tree = red_black_tree.RBTree()
# 23, 4, 30, 11, 7, 34, 20, 24, 22, 15, 1
for key, data in basic_tree:
tree.insert(key=key, data=data)
assert tree.get_leftmost(tree.root).key == 1
assert tree.get_leftmost(tree.root).data == "1"
assert tree.get_rightmost(tree.root).key == 34
assert tree.get_rightmost(tree.root).data == "34"
assert tree.search(24).key == 24
assert tree.search(24).data == "24"
tree.delete(15)
with pytest.raises(tree_exceptions.KeyNotFoundError):
tree.search(15)
def test_random_insert_delete():
"""Test random insert and delete."""
for _ in range(0, 10):
insert_data = random.sample(range(1, 2000), 1000)
delete_data = random.sample(insert_data, 500)
remaining_data = [
item for item in insert_data if item not in delete_data
]
remaining_data.sort()
tree = red_black_tree.RBTree()
for key in insert_data:
tree.insert(key=key, data=str(key))
for key in delete_data:
tree.delete(key=key)
result = [item for item, _ in tree.inorder_traverse()]
assert result == remaining_data
def do_build(self, line):
"""Build a binary tree.
Options: avl-tree, bst, rb-tree, threaded-bst
Example
-------
tree> build avl-tree
"""
try:
if self._tree is not None:
print(f"Tree {type(self._tree)} already exist")
return
tree_type = self._get_single_arg(line=line).lower()
if tree_type == "avl-tree":
self._tree = avl_tree.AVLTree()
elif tree_type == "bst":
self._tree = binary_search_tree.BinarySearchTree()
elif tree_type == "rb-tree":
self._tree = red_black_tree.RBTree()
elif tree_type == "threaded-bst":
threaded_type = input("Please input threaded type "
"(left, right, or double): ").lower()
if threaded_type == "left":
self._tree = threaded_binary_tree.LeftThreadedBinaryTree()
elif threaded_type == "right":
self._tree = threaded_binary_tree.RightThreadedBinaryTree()
elif threaded_type == "double":
self._tree = threaded_binary_tree.DoubleThreadedBinaryTree(
)
else:
print(f"{threaded_type} is an invalid threaded type")
else:
print(f"{tree_type} is an invalid tree type")
except KeyError as error:
print(error)
def test_deletion(basic_tree):
"""Test the deletion of a red black tree."""
tree = red_black_tree.RBTree()
# 23, 4, 30, 11, 7, 34, 20, 24, 22, 15, 1
for key, data in basic_tree:
tree.insert(key=key, data=data)
# No child
tree.delete(15)
assert [item for item in tree.inorder_traverse()] == [
(1, "1"),
(4, "4"),
(7, "7"),
(11, "11"),
(20, "20"),
(22, "22"),
(23, "23"),
(24, "24"),
(30, "30"),
(34, "34"),
]
# One right child
tree.delete(7)
assert [item for item in tree.inorder_traverse()] == [
(1, "1"),
(4, "4"),
(11, "11"),
(20, "20"),
(22, "22"),
(23, "23"),
(24, "24"),
(30, "30"),
(34, "34"),
]
# One left child
tree.insert(key=9, data="9")
tree.delete(11)
assert [item for item in tree.inorder_traverse()] == [
(1, "1"),
(4, "4"),
(9, "9"),
(20, "20"),
(22, "22"),
(23, "23"),
(24, "24"),
(30, "30"),
(34, "34"),
]
# Two children
tree.delete(23)
assert [item for item in tree.inorder_traverse()] == [
(1, "1"),
(4, "4"),
(9, "9"),
(20, "20"),
(22, "22"),
(24, "24"),
(30, "30"),
(34, "34"),
]