> On 7 Jul 2019, at 23:12, Smiljana Knezev <smilja.kne...@gmail.com> wrote: > > Dear all, > > I've written about implementing binary search trees: > https://pharokeepers.github.io/pharo/2019/07/07/SmiljanaBinarySearchTreeinPharo.html > > <https://pharokeepers.github.io/pharo/2019/07/07/SmiljanaBinarySearchTreeinPharo.html> > > Feedback and opinions is always welcome :)
pay attention to the formatting of your code. It makes is difficult to read (I do not know if this is wordpress effect or not). Once you have your tree implementation and tests I would really like to see if you can get another implementation and measure the impact of introducing a NullNode to remove all the isNil checks. > > Best regards, > Smiljana Knezev
