On the generation of binary trees in A-order

被引:10
|
作者
Ahrabian, H [1 ]
Nowzari-Dalini, A
机构
[1] Univ Tehran, Dept Math & Comp Sci, Fac Sci, Tehran, Iran
[2] Inst Studies Theoret Phys & Math IPM, Tehran, Iran
关键词
binary tree; code; recursion; traversal;
D O I
10.1080/00207169908804813
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
In this paper A-sequences, which are integer sequences characterizing binary trees are introduced. These sequences generate directly and lexicographically all the binary trees in the reverse order of A-order. The generation algorithm with ranking and unranking are provided. Furthermore, the similarities and the differences of A-sequences with the similar previous works are discussed.
引用
收藏
页码:351 / 357
页数:7
相关论文
共 50 条