Subject: Re: [xsl] A compelling use case for employing binary trees in XML processing? From: Wolfgang Laun <wolfgang.laun@xxxxxxxxx> Date: Mon, 10 Dec 2012 11:09:10 +0100 |
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? -W
Current Thread |
---|
|
<- Previous | Index | Next -> |
---|---|---|
Re: [xsl] A compelling use case for, Dimitre Novatchev | Thread | Re: [xsl] A compelling use case for, Dimitre Novatchev |
Re: [xsl] XML/XSL Revision Control/, Michel Hendriksen | Date | Re: [xsl] A compelling use case for, Hermann Stamm-Wilbra |
Month |