Article thumbnail

Iterative Formulas for Enumerating Binary Trees

By Limin Xiang, Kazuo Ushijima and 和夫 牛島

Abstract

Enumeration is an important aspect for combinatorial properties of binary trees. Traditional solutions for enumerating binary trees are expressed by algorithms and most of them are recursive. In this paper, we give our solutions by iterative formulas for enumerating binary trees. Iterative algorithms can be obtained easily based on the iterative formulas for enumerating binary trees, and the iterative algorithms can be guaranteed to be correct

Topics: Binary tree, Enumeration, Lexicographic, Natural ordering
Publisher: Graduate School of Information Science and Electrical Engineering
Year: 1997
OAI identifier: oai:catalog.lib.kyushu-u.ac.jp:2324/1522388
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://hdl.handle.net/2324/152... (external link)
  • https://portal.isee.kyushu-u.a... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.