Efficient generation of binary trees from inorder-postorder sequences

DOI10.1016/0020-0255(86)90007-1zbMath0639.68055OpenAlexW2091775221MaRDI QIDQ1099956

M. C. Er

Publication date: 1986

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(86)90007-1

zbMATH Keywords

binary treeconversion algorithminorder-postorder sequence

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Cites Work

• A numbering system for binary trees
• Generating Binary Trees Lexicographically
• Generation of Binary Trees from Ballot Sequences
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient generation of binary trees from inorder-postorder sequences