BINARY_SEARCH_TREEThis is a discussion on BINARY_SEARCH_TREE within the Eiffel forums in Programming Languages category; 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... | ||||||||
| | ||||||||
| ||||||||
| Register | FAQ | Calendar | Search | Today's Posts | Mark Forums Read |
|
#1
10-19-2007, 12:43 PM
| |||
| |||
 BINARY_SEARCH_TREE 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  |
|
#2
10-20-2007, 05:12 AM
| |||
| |||
| Re: BINARY_SEARCH_TREE Roman Töngi <roman.toengi@hispeed.ch> 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. |
 |
« Previous Thread
|
Next Thread »
| Thread Tools | |
| Display Modes | |
Linear Mode
All times are GMT -5. The time now is 05:14 AM.
