二叉树数据结构 meaning in English

binary tree data structure

The conventional ways has low efficiency , which result in the application of overlap grid in moving - grid problem , which need re - disposes the interpolating connection in every step in time direction , is very difficult considering the computational efficiency . aim at the above problem in application of overlap grid , this paper using an new manner rooting in analysissitus to put forward a “ method of distinguishing points of intersection ” and develop corresponding computational soft , which could realize the automatic and shape - independent pre - disposal process for overlap grid . to deal with the problem of low efficiency for pre - disposal process in moving - grid , this paper bring forward the “ mosaic ” method and adt method which based on the huge memory of modern computer
对于重叠网格在动网格应用中的计算效率问题,本文通过进一步研究插值信息的高速查询方法,提出不同于传统算法思路,以现代计算机大内存为基础,用计算机物理内存空间换计算时间的” mosaic ”方法以及应用基于二叉树数据结构的adt ( alternatingdigitaltree )方法两类方法,成功的将原处理时间提高了两个数量级? ?即将网格规模在百万量级的重叠网格预处理时间从传统方法的耗时30 60分钟提高到几十秒钟,从而成功解决了这一问题。