Can anyone outline a basic algorithm to return the next object in the Trie. The traversal is suppose to start at the root and work its way down the leftmost brances and then move right (in-order?)..