论文摘要翻译求助

来源:百度知道 编辑:UC知道 时间:2024/07/07 01:13:49
访问树的某层节点或者或者对树的部分进行遍历在软件设计中非常重要。在各个领域,都有重要的作用。在水利方面,对于城市的雨水管网的优化设计;在地理方面,采用四叉树结构存储多分辨率地形数据;而在计算机本身,利用树的遍历进行文件的拷贝。还有很多方法在应用树,而更多的方面还需要我们去探索。对于N叉树来说,却没有二叉树应用的那么普遍,课本上面介绍的也比较少,而且算法也是多种多样。文章对树的各种遍历算法进行了分析,主要是对树的分层遍历进行了深入的理解与分析。对树的结点进行遍历是树型数据结构的基本操作之一。这一操作的含义是按某种序巡访树中每一个结点。通过这种操作使得每个结点均被访问一次而且仅被访问一次。
关键词:树;二叉树;分层;遍历;递归,回溯

Some node to visit tree or or part in tree go on until calendar very much important in software design. In each field, have important function. In water conservancy, the optimization design of the rainwater pipe network of the city; In geography, adopt four forks to set up the structure to store the topographical data of many resolution ratios; Lie in computer oneself, utilize carrying on the copy of the file all over the calendar of the tree. Have a lot of method in tree of employing, and more respect need us go, explore. To tree of N fork, but there are not 2 forks of trees to employ then general, what the textbook is introduced above is fewer, and the algorithm is varied. The article has analyzed to calendar algorithm various times of the tree, have mainly carried on deep understanding and analysis to the dividing into layer of the tree all over the calendar. Carry on the joint of the tree all over one of the basic operation that the calendar is the tree type structure of data. T