⭐ Shop on Amazon to support me: [ Ссылка ]
⭐ NordVPN to protect your online privacy: [ Ссылка ]
⭐ NordPass to help manage all of your passwords: [ Ссылка ]

LeetCode 104. Maximum Depth of Binary Tree: [ Ссылка ]

⭐ Support my channel and connect with me:
[ Ссылка ]

Solutions explained:
Recursive solution: We'll add one to each level before traversing to its left and right children, return zero when the current node is null.

Iterative solution: We can use two extra data structures to help us mimic what happens when the recursive program runs, one is the stack that holds the tree nodes that we'll iterate on, the other is the depths of each of the node.

// TOOLS THAT I USE:
○ Memory Foam Set Keyboard Wrist Rest Pad - [ Ссылка ]
○ Electric Height Adjustable Standing Desk - [ Ссылка ]
○ Apple Magic Keyboard (Wireless, Rechargable) - [ Ссылка ]
○ Apple Magic Trackpad 2 (Wireless, Rechargable) - [ Ссылка ]
○ Apple MacBook Pro - [ Ссылка ]
○ All-In One Printer - [ Ссылка ]
○ Apple AirPods Pro - [ Ссылка ]
○ My new favorite Apple Watch - [ Ссылка ]

// MY FAVORITE BOOKS:
○ Introduction to Algorithms - [ Ссылка ]
○ Designing Data-Intensive Applications - [ Ссылка ]
○ Head First Java - [ Ссылка ]
○ Design Patterns - [ Ссылка ]


Follow me on Github for complete LeetCode solutions: [ Ссылка ]

Support me on Patreon: [ Ссылка ]

My ENTIRE Programming Equipment and Computer Science Bookshelf:
[ Ссылка ]

And make sure you subscribe to my channel!

Your comments/thoughts/questions/advice will be greatly appreciated!

#softwareengineering #leetcode #algorithms #coding #interview #SDE #SWE #SiliconValley #programming #datastructures

свернуть