Re: Am I abusing SORT? It sure ain't working for me....

Kenny Tilton wrote:

Looking at the population being sorted, I do not have the whole tree. (not every node goes through this operation I need sorted, and I queue up the operations and defer them until after the sort as they come up, so I only have part of the tree).

That does sounds a bit tricky. If the tree is small, then you could
afford to build a tree where the parents know their kids, and then
go through that.

--
Jens Axel Søgaard



.

Relevant Pages

  • [SUMMARY] Huffman Encoder (#123)
    ... Building the tree was our main interest in this ... A variation on this strategy is to use a single priority queue. ... that character value is added to the translation and the search ... The final bit of code puts the tree to work creating Drew's solution: ...
    (comp.lang.ruby)
  • Re: level order traversal of binary tree
    ... This queue is allocated in automatic storage, ... This declaration declares only front. ... number of nodes in the tree. ... of the null pointers in the leaves. ...
    (comp.lang.c)
  • Re: More Treeview questions
    ... > 2) Databinding of a tree is an absurd idea, ... > new nodes from the prototype(see the pattern of the same name). ... > you have databinding of the childnodes. ... >>a sort of databinding. ...
    (microsoft.public.dotnet.framework.windowsforms)
  • Re: Choice of data structure for large event queues?
    ... > from the queue, it is checked against the set. ... A tree, skip list, or ... yet another memory structure which contains the zombie'd part along with the ... a circular and expandable array (an array consiting of multiple smaller - ...
    (comp.programming)
  • Re: Vertigo warnings on BBC
    ... the term has come to encompass any sort of height related problems. ... Instead the bosses asked me to stay and agreed no more tree work for ... I'd be doing a high hedge, ... Eventually I went to my then north London doctor and told him. ...
    (uk.media.tv.misc)