• From: "Costello, Roger L." <costello@m...>
• To: "xml-dev@l..." <xml-dev@l...>
• Date: Tue, 8 Jan 2013 10:42:37 +0000

Hi Folks,

Dimitre and I collaborated to add a new chapter in the paper, "Pearls of XSLT and XPath 3.0 Design." 

The new chapter describes Dimitre's binary search tree implementation.

Here are the first couple of paragraphs:

CHAPTER 7: BINARY SEARCH TREES
This chapter contains code for creating and processing binary search trees. The code is implemented entirely in XPath. An advantage of an "XPath-only" solution is that it can be used (hosted) in many programs--it can be hosted in XSLT programs, in XQuery programs, and in any other programming language that hosts XPath. Thus "XPath-only" solutions are highly portable and reusable.

The XPath code inputs data from an XML document and stores the data into a binary search tree. By storing the data in a binary tree there are many operations that can be efficiently performed which would otherwise be difficult or inefficient.

More ... http://www.xfront.com/Pearls-of-XSLT-and-XPath-3-0-Design.pdf  

Dimitre Novatchev and Roger Costello