In class BINARY_SEARCH_TREE there is no "do_all"
routine which can be invoked with an agent as in
class LINKED_LIST.
One has to redefine routine "node_action" in a
descendant of BINARY_SEARCH_TREE. But what if
one needs more than one traversal routine.
Is class BINARY_SEARCH_TREE not intended for direct
use? But then it were a deferred class.
How can you find out the root node of BINARY_SEARCH_TREE?
Thx
