Re: [boost] Re: any interest in a 'tree' container?

From: Terje Slettebø (tslettebo_at_[hidden])
Date: 2002-10-10 17:30:59

>From: "Samuel Krempp" <krempp_at_[hidden]>

>> How does this relate to depth-first, breadth-first, etc.?

>I think "depth-first" usually reffers to Pre-order.
>While it is more natural for iterators to do Post-order (and so does
>kasper's code)

>breadth-first is Level-order (starting from root is again more natural, but
>it's the same if reversing the list, and inversing left and right..)

>From: "Gabriel Dos Reis" <gdr_at_[hidden]>

> Any of pre-order, in-order or post-order is a depth-first algorithm:
> You go down as far as you can before examining the rest of the nodes.

Thanks for the replies.

Regards,

Terje