二叉树回溯，利用栈实现，带界面演示，更加直观的查看每个时刻栈的情况。-Bintree back, using the stack to achieve, with the interface presentation and more intuitive view of the circumstances of each moment of the stack.