bmulvihill

@remcopeereboom When thinking about what operations to include on a BST I look back to CS Data Structures course and they usually always go through the main 4 (Traverse, Search,...

@remcopeereboom Couldn't this problem also exist in insertion if we are always inserting values to one side of the tree, and wouldn't this be more of a problem of balancing...

Good points @remcopeereboom I had to do a little research and refresh my brain a bit. I still think there is value in implementing the delete operation as it requires...

These are good points. I agree that exercism might not be the right place to teach algorithm analysis, and ruby does not lend itself well to implementing some of these...

I have been thinking about this some more. One thought would be to distance ourselves from the "binary search" aspect of the exercise, and through code reviews/breadcrumbs lead the developer...

@remcopeereboom This looks interesting, but I think forcing a user to implement a O(log n) search algorithm might be above the scope of exercism in its current form, and could...

@kotp I was looking at how Lua was using the traced array where they are ensuring that an element is found in O(log n) https://github.com/exercism/xlua/blob/master/exercises/binary-search/binary-search_spec.lua#L32-L37

> There is simply no reason to do binary search if not for performance. After all, a simple linear search can be used on collections that are not sorted and...

@Proximyst I am trying to recreate, what version of Scry are you using and which IDE?

@Proximyst under the hood the hover functionality uses `crystal tool context`. I cloned you're repo and ran `crystal tool context -f json -c spec/size_t_spec.cr:5:11 spec/size_t_spec.cr` and get the same error.