Reachability of nodes in a complete binary tree
- From: Joe <Joe.Reddington@xxxxxxxxxxxxxx>
- Date: Thu, 17 Jan 2008 08:16:19 -0800 (PST)
I have a complete binary tree of n levels. and 2^n - 1 nodes. Child
nodes are reached from parent nodes by either following a left link or
a right link.
Clearly every node in the tree can be identified by the sequence of
left and right links used to reach it from the root of the tree.
I am interested in the total number of nodes in the tree that can be
reached using only L left links.
I believe the total number of nodes to be less than or equal to
(n-1)^L but I am interested in any proofs or more exact numbers.
Can anyone point me in a sensible direction?
Joe
.
- Follow-Ups:
- Re: Reachability of nodes in a complete binary tree
- From: Mariano Suárez-Alvarez
- Re: Reachability of nodes in a complete binary tree
- Prev by Date: Re: Submanifold
- Next by Date: Re: divergent series
- Previous by thread: For any set E in R, How to prove m* ( E ) = m*_J ( E ) ?
- Next by thread: Re: Reachability of nodes in a complete binary tree
- Index(es):
Relevant Pages
|