• This was a project to implement the Binary Search Tree data structures using Python. It first creates a data structure for each node, then implements insert, search, remove, and popular traversals.
• Part 3 demonstrates the functionality of the data strucutre through insertions, deletions, searches, and printing the tree to demonstrate that it follows the strict weak ordering principle.# binary-search