数据结构对二叉树的深度遍历用进栈，出栈的方法。-The depth of the binary tree data structure traversal to use into the stack, a stack method.

二叉树的递归以及非递归创建，遍历，遍历包括前序.中序.后序.....，在其非递归创建和遍历时又分别利用了栈和队列等一系列方法进行-Recursive binary tree non-recursive traversal, as well as create, including the former sequence traversal sequence after sequence. .....

包含查找最大值、最小值的二叉搜索树方法，程序简洁明了-Binary search tree method comprising find the maximum, minimum, clear and concise program