A simple, recursive binary search tree implementation in python.
This code is inspired by http://cslibrary.stanford.edu/110/BinaryTrees.html#s1 and contains solutions to almost all the problems discussed in that page.
- tree()
- add(x)
- size()
- printinorder()
- printpostorder()
- maxdepth()
- printpaths()
- mirror()
- find(x)
- max()