Constructive combinatorics
Data structures: form and function
Data structures: form and function
A random binary tree generator
CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
A survey on binary tree codings
The Computer Journal - Special issue on data structures
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
A numbering system for binary trees
Communications of the ACM
Move-to-Front and Inversion Coding
DCC '00 Proceedings of the Conference on Data Compression
| Hi-index | 0.00 |
Associated with each permutation P = [x(1),x(2), … ,x(N)] of N (ordered) objects is its inversion table I(P) = {y(1),y(2), … ,y(N)}, a sequence of non-negative integers such that y(1) = 0 and, for i 1, y(i) is the number of terms in {x(1), x(2), … ,x(i-1)} which are greater than or follow the term x(i).A tree permutation is a permutation whose inversion table {y(1), … ,y(N)} has the property that y(i+1) - y(i) is less than 2 for i = 1, 2, … , N-1; such an inversion table is called a 2-inversion table. Tree permutations of {1, 2, … , N} are used to represent binary trees having N nodes. O(N) time algorithms are given for converting tree permutations into their associated 2-inversion tables and vice-versa.