GOOGLE - MAXIMUM DEPTH OF BINARY TREE (LeetCode)

This is one of Google's most commonly asked interview questions according to LeetCode (2019)! Maximum Depth of Binary Tree coding solution. If you give me 5 minutes you'll thank me if this appears during your interview! Coding Interviews Maximum Depth of Binary Tree (LeetCode) question and explanation. If you guys enjoyed this video be sure to leave it a like and subscribe to the channel for more!

DISCORD CHANNEL
----------------------------------------------------------------------------------------------------------------
To join the Discord channel use the following link and join the "Member" tier: https://www.patreon.com/KevinNaughtonJr
In this Discord channel, you will be able to...
1. Ask me questions directly (as well as other members)
2. Ask about and discuss previous interview experiences
3. Find mock interview partners
4. Share helpful videos for interview preparation, and more!

This question is commonly asked by the following companies: Google, Amazon, Apple, LinkedIn, and Yahoo.

Link to problem: https://leetcode.com/problems/maximum-depth-of-binary-tree/

Intuition behind solution: Constantly ask each left child and right child "what depth are you at?" until you return the base case and return 0. This 0 will eventually bubble back up to previous recursive calls where you'll add 1 to the maximum depth of the current node's left child and right child. By starting the recursive calls from the root of the tree, we will end up returning the maximum depth of the entire binary tree.

SOCIAL
----------------------------------------------------------------------------------------------------------------
Support me on Patreon: https://www.patreon.com/KevinNaughtonJr
Follow me on Twitter: https://twitter.com/KevinNaughtonJr
Follow me on Instagram: https://instagram.com/kevinnaughtonjr/
Follow me on GitHub: https://github.com/kdn251

MUSIC
----------------------------------------------------------------------------------------------------------------
GET MONEY W/ YUNGMAPLE by draffish ★
https://soundcloud.com/draffish/get-money

#coding #interviews #softwareengineering

Видео GOOGLE - MAXIMUM DEPTH OF BINARY TREE (LeetCode) канала Kevin Naughton Jr.