A SURVEY ON BINARY-TREE CODINGS

被引：22

作者：

MAKINEN, E

机构：

[1] Univ of Tampere, Tampere

来源：

COMPUTER JOURNAL | 1991年 / 34卷 / 05期

关键词：

D O I：

10.1093/comjnl/34.5.438

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

Several combinatorial and other programs deal with the structure (or the shape) of binary trees paying no attention to the data possibly maintained by the tree. For such programs it is useful to represent the structure without pointers and records. This paper surveys such representations. Especially, we concentrate on different ways of representing the structure of a binary tree by using a sequence of integers.

引用

页码：438 / 443

页数：6

共 42 条

[1]

[Anonymous], 1968, ART COMPUTER PROGRAM

[2]

BENT SW, 1990, LECT NOTES COMPUT SC, V447, P132

[3]

BURGDORFF HA, 1987, BIT, V27, P134, DOI 10.1007/BF01934177

[4] ENUMERATIONS OF ORDERED TREES [J].