P6- Write Tests for BinarySearchTree

slac207 / cs207project

MIT License

0 stars 3 forks source link

P6- Write Tests for BinarySearchTree #63

Closed cocochrane closed 7 years ago

cocochrane commented 8 years ago

My suggestion is to first implement the database as an unbalanced binary search tree: basically you need to cross the t's and dot the i's on the lab. The code can be more elegant, and you must document it better, and test it extensively.

jsm09 commented 7 years ago

Smoke tests has been written

jsm09 commented 7 years ago

Okay - just added a bunch of tests. Currently we're at 99% coverage for RedBlackTree.py

jsm09 commented 7 years ago

Closing this issue