所谓遍历(Traversal)是指沿着某条搜索路线，依次对树中每个结点均做一次且仅做一次访问。访问结点所做的操作依赖于具体的应用问 题。 -The so-called ergodic (Traversal) refers to a particular search along the line, followed on the tree each node are done once and only once to visit. Access node operation done de

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