Re: Sorted heap trees


"Richard Harter" <cri@xxxxxxxx> wrote in message >
I'm looking at a data structure that I have (re)invented that I
am calling a sorted heap tree. I dare say there is an official
name but I haven't a clue as to what it might be. What I am
looking for are references, preferably on-line, and anything
useful I can snarf up.

Sorry It is not clear enough.
You say , "This is a sorted tree, albeit not a BST"
Does that mean a parent node may have more than 2 children?
If so, are saying that all elements reachable under
C1 < C2 < C3 ... < CN?
or
C1 > C2 > C3 ... > CN?

where C1 is child1, C2 child2 and all is children in turn etc

Also if P is parent node are you saying

P < C1 < C2 < C3 ... < CN?
or
P > C1 > C2 > C3 ... > CN?

Cheers

Stephen Howe


.