Create binary-tree-inorder-traversal.cpp

Classic application of stack to replace recursive function call.
The middle node has to be pushed into stack before its left child, and its right child has to be visited after it has been popped.