return TernarySearchTreeNode0.search(root, key, 0);
root = TernarySearchTreeNode0.insert(root, key, 0, value); return null; //fake it for now
if (root != null) {root.clean(); root = null;}