Skip to main content
Article thumbnail
Location of Repository

On Complete and Size Balanced k-ary Tree Integer Sequences SUNG-HYUK CHA

By 

Abstract

Abstract: Discovering new integer sequences and generalizing the existing ones are important and of great interest. In this article, various balanced k-ary trees are first studied and their taxonomy is built. In particular, two systematic balanced k-ary trees, whose nth tree is determined by a certain algorithm, are identified, i.e., complete and sizebalanced k-ary trees. The integer sequences from the formal one is important to analyzing algorithms involving the popular d-heap data structures. Those derived from the later one is pervasive in analyzing divide and conquer algorithms. Numerous generalized and new formulae for existing and new integer sequences generated from the complete and size-balanced k-ary trees are given. Key–Words: complete k-ary tree, integer sequence, null-balanced k-ary tree, size-balanced k-ary tre

Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.352.3650
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://naun.org/multimedia/UPr... (external link)
  • Suggested articles


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