Cart
|
[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 2:20 PM Costello, Roger L. <costello@mitre.org> wrote:
Yes. that's it. You can dispense with binary-tree as well and just use root-node.
I think it does. Your design has node as the sole child of left-child and right-child. I am just talking about merging their functions into a single element, one that says it is a node *and* which child it is. If you knew there would never be any nodes with just one child, you could use just node elements and let ordering do the work (left first, right second), but that limits the applicability. John Cowan http://vrici.lojban.org/~cowan cowan@ccil.org With techies, I've generally found If your arguments lose the first round Make it rhyme, make it scan / Then you generally can Make the same stupid point seem profound! --Jonathan Robie 
[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
|
|||||||||
