[XML-DEV Mailing List Archive Home] [By Thread] [By Date] [Recent Entries] [Reply To This Message] =?UTF-8?Q?Re=3A_=5Bxml=2Ddev=5D_Representing_binary_trees_in_XML_=E2=80=
On Thu, Jul 4, 2019 at 9:45 AM Costello, Roger L. <costello@mitre.org> wrote:
A simpler XML approach is to use elements named root-node, left-node, and right-node. That reduces the number of levels in the tree by half. In addition, I don't know of any parsers that use recursion in the language to support recursion in the tree; the nesting is normally stored as an array of element objects, either fixed (in which case you get an error) or growable. Such a structure can of course be traversed in XSLT, but not with native traversal mechanisms.. Your flat representation doesn't gain you much, then. John Cowan http://vrici.lojban.org/~cowan cowan@ccil.org Cash registers don't really add and subtract; they only grind their gears. But then they don't really grind their gears, either; they only obey the laws of physics. --Unknown
[Date Prev] | [Thread Prev] | [Thread Next] | [Date Next] -- [Date Index] | [Thread Index] |
PURCHASE STYLUS STUDIO ONLINE TODAY!Purchasing Stylus Studio from our online shop is Easy, Secure and Value Priced! Download The World's Best XML IDE!Accelerate XML development with our award-winning XML IDE - Download a free trial today! Subscribe in XML format
|