Hi all, We have an unsorted set like S. We put the elements of the set
sequentially on the leaves on a conplete binary tree. I'm looking for
an algorithm to sort the set S with this binary tree structure. The
result should be available on the leaves of the tree again.
Example:
S = {5, 2, 3, 1}
Re: Cantor and the binary tree ... to do with paths on a tree,... > nothing to do with the number of unending paths.... Actually, if you have an infinite binary tree, with all paths unending, it's ... (sci.math)
Re: Cantor and the binary tree ... > There are no finite paths in my tree.... nothing to do with the number of unending paths.... All unending paths in an unending binary tree contain infinitely many ... represented by a terminating binary fraction,... (sci.math)
Re: Cantor and the binary tree ... Rather, each one leads to another (unending, infinite) subtree. ... But for this new tree and each of its nodes the ... And if the binary tree is maximal as described, for each natural, there ... Given any maximal path in this maximal binary tree, ... (sci.math)
Re: About jumps in trees ...binary tree without jumps.... numbered sub-tree for the first time do nothing. ... (comp.programming)
Re: Cantor and the binary tree ... > unending paths which have no terminal or leaf nodes. ... > 2) All nodes of the tree belong to a countable set. ... > paths in any finite binary tree. ... and if one is infinite,... (sci.math)
