writing some manual test methods for binary suffix string tree
I am waiting for a python machine learning book to get here via the Amazon fairy, so in the meantime I decided to play with the exercise from class I left off on. The goal I had in mind was to put words as the key, and a suffix list as the value into the binary tree. Then add the binary searchs through the suffix list into the tree. So someone could search through the tree for the suffix they were looking for, and get any key value that had a matching suffix in their suffix list. If I had a tree of DNA strings say.... and I wanted to make a tree, and find all the key DNA sequences that contained 'AcTGAT' , it could return me a list of them. I don't have it accomplished yet, but I just started doing this to get my head back into this files code. I find it extremely useful to just tinker around with stuff. See what I can make it do. Might not be useful to whoever is reading this, but I find it fun and worthwhile. Picture: Using my PrintTree class I made ...