Re: BINARY_SEARCH_TREE

Roman Töngi <roman.toengi@[EMAIL PROTECTED]
> writes:

> In class BINARY_SEARCH_TREE there is no "do_all"
> routine which can be invoked with an agent as in
> class LINKED_LIST.
Yes you are are right. What you can do is 
call to_linear or the like and there you can use the agents.
>
> One has to redefine routine "node_action" in a
> descendant of BINARY_SEARCH_TREE. But what if
> one needs more than one traversal routine.
Then you have to have different descendants....
>
> Is class BINARY_SEARCH_TREE not intended for direct
> use? But then it were a deferred class.
Well node_action has not implementation, but you can use all the rest.


Regards
Friedrich

-- 
Please remove just-for-news- to reply via e-mail.