After a ton of diagram drawing and article re-reading I have finally understood how the height of a balanced binary tree can be represented in Big O Notation as simply O(log(n)) where n is equal to the number of nodes in the tree. It honestly still is a bit fuzzy in my head but I definitely understood most if not all of the steps! Satisfaction!! Wow, I’m feeling happy.

TLDR;

Okay, so here are the highlights of what I did:

• Still reading through the book “Cracking the Coding Interview” by Gayle Laakmann McDowell. Still working on example nine. I worked through the steps shown in an article explaining the proof of the height of a balanced binary tree. I finally got through all the steps with a pretty clear understanding of what was happening. I still need to write out my notes to help me better understand but at least I can finally move on. What a rabbit hole that was. LOL.

Conclusion

That’s all for today. If you are interested in the MIT course you can check out the video lecture I’m currently going through. The lecture is helpful but isn’t sufficient by itself. Anyways, until next time PEACE!