I learned that through the use of Mathematical induction, the height formula (h = Log N) for a balanced binary tree can be proven correct. I have never practiced mathematical induction but I guess now is a good time to learn. After reading an Wikipedia article I felt a little confused so I started working on some practice problems from a YouTube video. This same channel helped me practice my logarithms. It’s weird because his channel has a title that is related to organic chemistry not math. Maybe I am missing something.

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 started practicing Mathematical induction to try and use it to prove the formula for calculating the height of a balanced binary tree.

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!