But after this, you will.
In this assignment, you will engage in a test-driven development process to implement a binary search tree. We'll call it a "BinarySearchTree."
python3 -m unittest test_bst
Open both test_bst.py and bst.py in your editor of choice. Modify the implementation in bst.py to pass the first test. Once it passes, create a commit. Then, uncomment the next test, and re-run the test suite. Implement what's necessary to pass the test, and then repeat this process.
But wait!
Toward the middle of the test suite, you should be thinking about the algorithmic efficiency of each operation. What should be O(log n)? In addition, try to implement your operations using recursion, whenever possible.
Get together with a friend in front of just one machine, and take turns being the driver. Change drivers after each test is passed. Don't forget to commit after each test.
(c) 2019 Yong Joseph Bakos. All rights reserved.