traversal of binary tree 中文意思是什麼
traversal of binary tree
解釋
二叉樹遍歷-
In this paper, a lot of researches and exploration are applied to studying the universality and expansibility of hardware and the arithmetic design and code optimization of software. especially, all of the following arithmetics or conceptions are worked out in the research of software design : self - adaptable compression arithmetic based on dictionary model for data collection system, similarity full binary sort tree, a optimized quick search arithmetic and an improved arithmetic of multiplication in the floating - point operation. and all of the arithmetic are designed with mcs - 51 assembly language. the quick search arithmetic, in which merits of both binary search and sequence search are used fully, are based on the specialty of preorder traversal in similarity full binary sort tree
特別在軟體設計研究中,提出了適用於數據採集系統的數據壓縮演算法? ?基於字典模型的自適應壓縮演算法;提出了類滿二叉排序樹的定義;提出了基於類滿二叉排序樹的先序遍歷特性的最優化快速查找演算法,它充分利用了折半查找和順序查找各自的優點;提出了浮點運算乘法的改進演算法;並在mcs - 51匯編語言層次上對所有的演算法加以實現。 -
According to binary tree level traversal principle, this article embarks from fully binary tree ' s definition and the nature, and proposes a method to judge fully binary tree on the basis of traversing binary tree
摘要從完全二叉樹的定義及性質出發,根據二叉樹的層次遍歷原則,提出了一種遍歷法判斷完全二叉樹的方法。
分享友人