0,2

"Complete" or "full binary tree" refers to a unique binary tree of (2^n)-1 nodes with its 2^(n-1) leaves all on the same height (or depth) n-1 (when the root is at height 0). These are depicted at A073346. This differs from "completely binary tree", with which some authors refer to trees more akin to the trees encoded by A080299.

Index entries for encodings of plane rooted trees

a(n) = A014486(A084108(n)). Subset of A083941.

Sequence in context: A088920 A079198 A080293 this_sequence A057943 A037419 A078165

Adjacent sequences: A084104 A084105 A084106 this_sequence A084108 A084109 A084110

nonn

Antti Karttunen (MyFirstname.MySurname(AT)iki.fi) May 13 2003