摘要
在二叉树的一些应用中,常常要求在树中查找具有某种特征的节点,或者对树中全部节点逐个进行某种处理。这就提出了一个遍历二叉树的问题,即如何按某条搜索路径访问树中每个节点,使得树中每个节点都被且仅被访问一次。
In binary tree some applications,often calls in tree search has some characteristic of the node,or in one tree all nodes some processing.This raises an ergodic binary tree's problems,namely,according to one of the search path to visit every node in the tree,makes every node in the trees have been and only be accessed again.
出处
《电脑知识与技术（过刊）》
2011年第10X期7249-7249,7254,共2页
Computer Knowledge and Technology
关键词
二叉树
遍历二叉树
搜索路径
binary tree
traversing binary tree
search path
