Python Data Structures and Algorithms

Binary search tree implementation

Let us begin our implementation of a BST. We will want the tree to hold a reference to its own root node:

    class Tree:         def __init__(self):             self.root_node = None 

That's all that is needed to maintain the state of a tree. Let's examine the main operations on the tree in the next section.