Amazon Coding Interview Question - Sum of Left Leaves (LeetCode)

Video Description

Here is a step by step explanation of a tree based question asked at Amazon. Check out my interview prep platform for learning the patterns! 📢 Interview Prep Platform: https://algoswithmichael.com 🎧 Join the community Discord: https://discord.gg/aVWsAaaCtT 💰 Support me on Patreon: https://www.patreon.com/michaelmuinos 🔗Follow me on LinkedIn: https://www.linkedin.com/in/michael-muinos 📂Follow me on Github: https://github.com/MichaelMuinos In this video, I go over the problem “Sum of Left Leaves” where we must sum up all left child nodes that are leaves in a given binary tree. This is a problem asked at both Amazon and Expedia. A leaf is a node that does not have a left or right child connected to it, thus the premise behind solving this problem is every node we visit we must check the left child to see if it is null or not. If it is not null, we determine if it is a leaf. Determining if the node is a leaf or not can be offloaded to a helper function. If it is a leaf, then we add the value of the node to a sum variable which will eventually be returned from our function as the final result. This problem can be solved recursively or iteratively. In the iterative approach, you may use a stack or a queue to solve the problem, the logic will be the same. I go over the queue solution, but it is up to you how you want to implement the iterative approach. The time and space complexity for both the recursive and iterative approach is O(N) where N is the number of nodes we have in the binary tree.