On Counting and Embedding a Subclass of Height-Balanced Trees. (26th May 2014)

• Record Type: Journal Article
• Authors: Raman, Indhumathi
• Other Names: Song Aiguo Academic Editor.
• Is Part Of: Modelling and simulation in engineering. Volume 2014(2014)
• Publication Date: 2014-05-26
• Subjects: Engineering -- Simulation methods -- Periodicals; Engineering -- Mathematical models -- Periodicals; 620.004
• DOI: 10.1155/2014/748941
• Languages: English
• ISSNs: 1687-5591

Abstract

Abstract : A height-balanced tree is a rooted binary tree in which, for every vertexv, the difference in the heights of the subtrees rooted at the left and right child ofv (called the balance factor ofv ) is at most one. In this paper, we consider height-balanced trees in which the balance factor of every vertex beyond a level is0 . We prove that there are2 2 t - 1 such trees and embed them into a generalized join of hypercubes .