Yes, itís just a different form of storage of the same data. Obviously, you have to store enough information to find your way around the tree somewhere. If itís not one place, itís another. However, this algorithm really does not use a stack, at least not if you define a stack in the only way which makes sense Ė that is, as a data structure whose defining property is support for the operations of pushing things onto the top and popping them off the top.
It consumes more space, of course, to keep all those parent pointers around. If you use a stack, they are transient and you only need O(log n) stack space, whereas itís O(n) if you store the pointers with the nodes Ė another way in which the two approaches are truly distinct.
What I like about this approach (which is what compelled me to post it) is the exceptional simplicity of the traversal algorithm. When it first occured to me, it seemed too simple to work Ė but no, the position and direction of the traverser encodes enough information to guide its path along the entire tree in the right order without any ambiguity.
Makeshifts last the longest.
Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
Read Where should I post X? if you're not absolutely sure you're posting in the right place.
Please read these before you post! —
Posts may use any of the Perl Monks Approved HTML tags:
Outside of code tags, you may need to use entities for some characters:
- a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
Link using PerlMonks shortcuts! What shortcuts can I use for linking?
See Writeup Formatting Tips and other pages linked from there for more info.
| & || & |
| < || < |
| > || > |
| [ || [ |
| ] || ] ||