[30] LeetCode: Minimum Depth of Binary Tree | Step-by-Step Solution
LeetCode Problem #111: Minimum Depth of Binary Tree
Difficulty: Easy
Language: TypeScript
Technique: Use recursion, or use BFS by using queue node as 2D array consisting of node and depth to be processed without recursion
Functions used: Math.min(), while loop, array destructurization, Array.shift(), Array.push()
Music used:
--------------------------------------------------------------
🎵 Music "Something Blue" by ‘Fool Parsley’
• fool parsley - something blue 🌀 royalty fr...
💿 Listen everywhere:
https://lofihiphop.de/somethingblue
✅ For more Copyright Free Music visit:
https://youtube.tamamusic.com
--------------------------------------------------------------
Tags:
#leetcode #codinginterview #codechallenge #codewithme #algorithm #typescript #javascript #solution #codingsolutions #recursion #linkedlist #linkedlists #breadthfirstsearch #bfs