This is a BST implementation in FreeBASIC.
You can:
-
printPreorder
-
printPostorder
-
printInorder
-
search for a value
-
get height of BST
-
Insert a value
-
delete a value
-
get size of BST
-
visualize each node with printPath sub
This work is under GPL3
Developers: fxm, demosthenesk