First commit
Add Node class, BST class, test_file
Add _search() method that traverses the tree in search of the specified value. If the value is found, return the Node to which it belongs. Otherwise, if the value is not found, return the position that the value should occupy (value == None) along with the parent Node that points to that position. **Except if the tree is empty, in which case, return None
Add insert() and unit tests
Add contains() method and test cases
Add size() function, and test cases
Add depth() method and testing. That took a bit to think through
Add balance() and tests. Though I don't believe that my balance method is what is being asked for, I don't know what actually is meant by the instructions for balance(), so for now I have just taken the instructions at face-value
Implement delete() method to handle deletions of leaf nodes and nodes with a single child. Add test cases.
Add more test cases
initial commit
empty commit message
Add init function and test case
Add add_edge)_, add_vertex methods and test cases. Delete Vertex class: verticies no longer distinguished from their data.
Old file corrupted--create new file. Change vertex/verticeis to node/nodes
Change 'vertex' to 'node'
Add test case for delete functionality
Re-rename graph.py
Add delete_node() and unit tests
Rename test file to match new_graph file. Add __repr__, __str__, __eq__ methods to Node class