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!
|