Binary Tree Preorder Traversal

Approach 1: Use a stack to store left and right children. Push right
child first, then push left child. No need to have a visited set.