def test_edge(self):
root = Node(value=7,
right=Node(value=7)
)
print()
result = insert(root, 7)
print_tree(result)
self.assertEqual(tree_equal(result, Node(value=7,
right=Node(
value=7,
right=Node(value=7)
)
)), True)
def test_one(self):
root = Node(value=7,
right=Node(
value=8,
left=Node(value=7)
)
)
print()
result = insert(root, 6)
print_tree(result)
self.assertEqual(tree_equal(result, Node(value=7,
left=Node(value=6),
right=Node(
value=8,
left=Node(value=7)
)
)), True)
from node import Node
from insert_node import insert
from print_inorder_bst import inorder
from search_node import search
from delete_node import delete_node
if __name__ == '__main__':
r = Node(50)
insert(r, Node(30))
insert(r, Node(20))
insert(r, Node(40))
insert(r, Node(70))
insert(r, Node(60))
insert(r, Node(80))
# Print inorder traversal of the BST
print("inorder treversal of the BST ")
inorder(r)
key = int(input("Enter Key : "))
print("key found : ", search(r, key))
key = int(input("Enter Key : "))
print("key is deleted ", delete_node(r, key))
def test_none(self):
print()
# noinspection PyTypeChecker
result = insert(None, 5)
print_tree(result)
self.assertEqual(tree_equal(result, Node(value=5)), True)