>
>>  can we assume that our method is for a class implementing comparable like
>  > the one you wrote recursively does?

This must be the question about rewriting recursive binary
tree insertion non-recursively.

Yes, you may assume there is a function comparable.
You are really re-writing one method, keeping everything
else fixed.

- jeff parker

Reply via email to