[XSL-LIST Mailing List Archive Home] [By Thread] [By Date]

Re: [xsl] A compelling use case for employing binary trees in XML processing?

Subject: Re: [xsl] A compelling use case for employing binary trees in XML processing?
From: Dimitre Novatchev <dnovatchev@xxxxxxxxx>
Date: Mon, 10 Dec 2012 04:44:31 -0800

On Mon, Dec 10, 2012 at 2:09 AM, Wolfgang Laun <wolfgang.laun@xxxxxxxxx> wrote:
> On 10/12/2012, Dimitre Novatchev <dnovatchev@xxxxxxxxx> wrote:
>> A binary *search* tree (and I mean *balanced* binary serch tree) has
>> more useful properties than just that it one of its serializations
>> presents the values in sorted order.
> Just a request for clarification: the code presented in
> [1] http://dnovatchev.wordpress.com/2012/01/09/the-binary-search-tree-data-structurehaving-fun-with-xpath-3-0/
> is not intended to implement a "balanced" tree?

No, although the delete node operation is implemented in a way that
must not unbalance the tree. The implementation of the delete node
operation is described in the second post on binary search trees.

> -W

Dimitre Novatchev
Truly great madness cannot be achieved without significant intelligence.
To invent, you need a good imagination and a pile of junk
Never fight an inanimate object
To avoid situations in which you might make mistakes may be the
biggest mistake of all
Quality means doing it right when no one is looking.
You've achieved success in your field when you don't know whether what
you're doing is work or play
Facts do not cease to exist because they are ignored.
Typing monkeys will write all Shakespeare's works in 200yrs.Will they
write all patents, too? :)
I finally figured out the only reason to be alive is to enjoy it.

Current Thread