Reverse linkedlist - use iterative or recursion — iteratively use the head.next.next back to head — look for edge conditions Trie is modeled using a node having a array of nodes having value from 0-25. Then implement search on the trie by looking at each level.