Listing and counting subtrees of equal size of a binary tree

DOI10.1016/0020-0190(83)90046-7zbMath0521.68072OpenAlexW2061004850MaRDI QIDQ1055196

Teruo Hikita

Publication date: 1983

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(83)90046-7

zbMATH Keywords

efficient algorithmbinary tree generationinorder- preorder sequencessubtree countingsubtree listing

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Related Items

Two algorithms for constructing a binary tree from its traversals ⋮ Parallel general prefix computations with geometric, algebraic, and other applications ⋮ A note on the reconstruction of a binary tree from its traversals ⋮ Optimal binary search trees ⋮ Efficient reconstruction of binary trees from their transversals ⋮ Constructing a binary tree from its traversals ⋮ Efficient algorithms for tree reconstruction ⋮ On generating B-trees with constant average delay and in lexicographic order ⋮ Fast algorithms for genegrating integer partitions

Cites Work

• Unnamed Item
• Unnamed Item
• Lexicographic generation of ordered trees
• The average height of binary trees and other simple trees
• Listing and Counting Subtrees of a Tree
• A numbering system for binary trees
• Generating Binary Trees Lexicographically
• Generation of Binary Trees from Ballot Sequences
• Ranking and Listing Algorithms for k-Ary Trees
• Generating Trees and Other Combinatorial Objects Lexicographically