Leetcode Blind 75 C++: Maximum Depth of Binary Tree

preview_player
Показать описание
Hey Everyone, Im going over the Blind 75, so decided to make a series on them to help solidify concepts prior to interviews. Below I have attached my notes from doing questions and if have any other questions feel free to let me know!

Thank you
  1. Gunnar Beck Nelson
  2. leetcode
  3. the blind 75
  4. big tech
  5. tech interviews
  6. tech interviews C
Рекомендации по теме
Leetcode Blind 75 0:04:25

Leetcode Blind 75 C++: Maximum Depth of Binary Tree

Leetcode Blind 75 0:08:23

Leetcode Blind 75 C++: Maximum Subarray with Explanation

8 patterns to 0:07:30

8 patterns to solve 80% Leetcode problems

Maximum Subarray - 0:08:03

Maximum Subarray - Amazon Coding Interview Question - Leetcode 53 - Python

The unfair way 0:06:47

The unfair way I got good at Leetcode

I solved too 0:00:54

I solved too many Leetcode problems

How many Leetcode 0:00:30

How many Leetcode problems Googlers have solved? #sde #google

How to EASILY 0:00:58

How to EASILY solve LeetCode problems

🌟Leetcode Blind 75 0:12:44

🌟Leetcode Blind 75 in C++: All Array-Refreshers!🌟

Leetcode Blind 75 0:21:52

Leetcode Blind 75 C++: Longest Repeating Character Replacement

Blind 75 Leetcode 11:40:55

Blind 75 Leetcode Java - All Questions Solved

Leetcode Blind 75 0:08:52

Leetcode Blind 75 C++: Same Tree

Leetcode 128 - 0:09:24

Leetcode 128 - LONGEST CONSECUTIVE SEQUENCE

LeetCode was HARD 0:13:00

LeetCode was HARD until I Learned these 15 Patterns

How many LeetCode 0:00:58

How many LeetCode problems should you solve? #leetcode #techinterview #developer #softwareengineer

Array 1.5 | 0:08:51

Array 1.5 | Maximum Subarray | Blind 75 Leetcode | C++ | Interview Placement | Leetcode 53

Leetcode Blind 75 0:10:21

Leetcode Blind 75 C++: Binary Tree Maximum Path Sum

Leetcode Blind 75 0:10:16

Leetcode Blind 75 C++: Max Product Subarray with Explanation

4 Leetcode Mistakes 0:00:43

4 Leetcode Mistakes

Two Sum - 0:08:26

Two Sum - Leetcode 1 - HashMap - Python

LeetCode Blind 75 0:04:21

LeetCode Blind 75 Solutions - Question 5(Maximum Subarray)

Array : Maximum 0:26:44

Array : Maximum Subarray | JAVA (LeetCode : 53) | Blind 75 LeetCode Questions

I tried Grind 0:05:54

I tried Grind 75 to prep for my Google Interview

Blind 75 - 0:12:04

Blind 75 - Maximum Product Subarray

Комментарии
Автор

I don't understand, this seems over simplified.

If the right leaf node 20 splits left, and then had an additional leaf node below 15, wouldn't your function miss it? I think what you've written here's just goes all the way to the left, then all the way to the right and then returns the furthest one?

Or does maxDepth do these internal leaf node checks itself?

davidhallinen-lics
welcome to shbcf.ru