Tag Info

New answers tagged

0

As far as I can tell, a "sibling list" implementation of a suffix tree, a "left-child right-sibling binary tree" and a "doubly-chained tree" are all exactly the same data structure. Source 1: The NIST Dictionary of Algorithms and Data Structures entry for "binary tree representation of trees" states that this is Also known as first child-next sibling ...


1

In the algorithm you provided, although it is true that the same in-order operation is performed in the same node multiple times, it is still ran once for each node and each node is visited only once. Note that this isn't a "in-order" tree traversal, you can't make such a traversal on a ntree, it just doesn't make sense. This is simply a deep-first ...



Top 50 recent answers are included