starting my binary search tree structure
starting a bst structure with basic add and display
add now transcends the tree properly
fixing add bug and updating display to now loop through the while tree
cleaning up functions slightly
cleaning up a little more, display dones't need a pointer and the next
function has no purpose anymore
adding deconstructor
adding a find function starting a delete
adding delete function, currently it will delete reference to all
children of the delete node, gotta fix that
re-adding values from broken tree
using deleteBranch instead of Delete so that we dont use too much memory
cleaning up some more code
Merge pull request #8 from obihann/bst

Bst