See more

These are two actionable insights from this competition, even before we get to the machine learning: households with greater levels o…

…ode in the unbalanced tree by the time we actually found the one node that we were looking for. So, instead of being able to search in logarithmic time, we’re searching in linear, or O(n) time.

And herein lies the rub: the logarithmic nature of BST’s only applies and can only be maintained if they are balanced. Take, for example, the unbalanced tree we saw earlier, with a root node of 20. Imagine that we need…

20