On Counting and Embedding a Subclass of Height-Balanced Trees
A height-balanced tree is a rooted binary tree in which, for every vertex v, the difference in the heights of the subtrees rooted at the left and right child of v (called the balance factor of v) is at most one. In this paper, we consider height-balanced trees in which the balance factor of every ve...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2014-01-01
|
| Series: | Modelling and Simulation in Engineering |
| Online Access: | http://dx.doi.org/10.1155/2014/748941 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832548713883500544 |
|---|---|
| author | Indhumathi Raman |
| author_facet | Indhumathi Raman |
| author_sort | Indhumathi Raman |
| collection | DOAJ |
| description | A height-balanced tree is a rooted binary tree in which, for every vertex v, the difference in the heights of the subtrees rooted at the left and right child of v (called the balance factor of v) is at most one. In this paper, we consider height-balanced trees in which the balance factor of every vertex beyond a level is 0. We prove that there are 22t-1 such trees and embed them into a generalized join of hypercubes. |
| format | Article |
| id | doaj-art-ee5f1a54ff23463d967c35ce9f2e2e38 |
| institution | Kabale University |
| issn | 1687-5591 1687-5605 |
| language | English |
| publishDate | 2014-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Modelling and Simulation in Engineering |
| spelling | doaj-art-ee5f1a54ff23463d967c35ce9f2e2e382025-02-03T06:13:26ZengWileyModelling and Simulation in Engineering1687-55911687-56052014-01-01201410.1155/2014/748941748941On Counting and Embedding a Subclass of Height-Balanced TreesIndhumathi Raman0School of Information Technology and Engineering, VIT University, Vellore 632014, IndiaA height-balanced tree is a rooted binary tree in which, for every vertex v, the difference in the heights of the subtrees rooted at the left and right child of v (called the balance factor of v) is at most one. In this paper, we consider height-balanced trees in which the balance factor of every vertex beyond a level is 0. We prove that there are 22t-1 such trees and embed them into a generalized join of hypercubes.http://dx.doi.org/10.1155/2014/748941 |
| spellingShingle | Indhumathi Raman On Counting and Embedding a Subclass of Height-Balanced Trees Modelling and Simulation in Engineering |
| title | On Counting and Embedding a Subclass of Height-Balanced Trees |
| title_full | On Counting and Embedding a Subclass of Height-Balanced Trees |
| title_fullStr | On Counting and Embedding a Subclass of Height-Balanced Trees |
| title_full_unstemmed | On Counting and Embedding a Subclass of Height-Balanced Trees |
| title_short | On Counting and Embedding a Subclass of Height-Balanced Trees |
| title_sort | on counting and embedding a subclass of height balanced trees |
| url | http://dx.doi.org/10.1155/2014/748941 |
| work_keys_str_mv | AT indhumathiraman oncountingandembeddingasubclassofheightbalancedtrees |