Added different implementation of binary tree deserializer using forward only lookup pointer. The name is due to special language feature in C++ and C# where primitives can be passed by ref. Similarly to reading next character from the file increments the file pointer. The algorithm has O(n) runtime, always.
Added word palindrome

Word Palindrome problem reverses all words in the sentence without
reversing the characters.
Two solutions:
- naive, using framework libraries
- optimized. Two short stacks (max size is the max length of the longest
word), and 2n traversals of the string. So it is O(n) runtime.
-------------------
P.S. So ideally the problem should be called sentence palindrome, but
even then the meaning changes.
Merge branch 'master' of https://github.com/neowu/interview