数学物理学报(英文版) ›› 1998, Vol. 18 ›› Issue (4): 421-426.
黄竞伟1, 戴大为2
Huang Jingwei1, Dai Dawei2
摘要: This paper presents a new tree sorting algorithm whose average time complexity is much better than the sorting methods using AVL-Tree or other balanced trees. The experiment shows that our algorithm is much faster than the sorting methods using AVL-Thee or other balanced trees.