I haven’t answered my question on how to calculate the depth of a balanced binary search tree but I did do some review. All the memories of the first time I learned about Binary Trees is coming back to me. A few YouTube videos later and I feel a bit more confident in solving this problem.

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 watched a few YouTube videos that explain what Trees, Binary Trees, and Balanced Binary Trees are. They compared them to linked lists and explained some of the terms that are used. I feel like I remember a lot of this stuff but I could be delusional lol. I still have a long way to go before I understand how to derive the formula for calculating the depth of a balanced binary tree.
• Continued working through the module called “Introduction to Microsoft Power Platform”. I read through a summary section and started going through a knowledge quiz for the module. So far I need to review lol. I don’t feel confident in my answers at all.

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!