/* Author : Rick van der Zwet * S-number : 0433373 * Version : $Id: HOWTO.txt 322 2007-11-22 14:09:00Z rick $ * Copyright : FreeBSD Licence */ Implemented trie, look at http://en.wikipedia.org/wiki/Trie to have a decent explanation * Every TreeNode has got the Value attached, this could also be a seperate class with a pointer to store some space * ExistsChild is implemented to store the value of the node (if found any) to NodeFound to prevent extra work * GoChild is implemented to have some checking wether a node exists, cause I had to follow to the path anyway when checking if ExistsChild * We use bitwise shifting 1<