Table of Contents Author Guidelines Submit a Manuscript
Modelling and Simulation in Engineering
Volume 2014 (2014), Article ID 748941, 5 pages
http://dx.doi.org/10.1155/2014/748941
Research Article

On Counting and Embedding a Subclass of Height-Balanced Trees

School of Information Technology and Engineering, VIT University, Vellore 632014, India

Received 7 February 2014; Revised 5 May 2014; Accepted 5 May 2014; Published 26 May 2014

Academic Editor: Aiguo Song

Copyright © 2014 Indhumathi Raman. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

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