On Counting and Embedding a Subclass of Height-Balanced Trees
Keyword(s):
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 are22t-1such trees and embed them into ageneralized join of hypercubes.
2006 ◽
Vol DMTCS Proceedings vol. AG,...
(Proceedings)
◽
Keyword(s):
Keyword(s):
2021 ◽
Vol 11
(1)
◽
pp. 112-122
Keyword(s):
2006 ◽
Vol 29
(1)
◽
pp. 46-50
◽
Keyword(s):
2020 ◽
Vol 47
(2-3)
◽
pp. 41-47
Keyword(s):
2020 ◽
Vol 398
◽
pp. 34-40
◽
Keyword(s):