tree7 LeetCode. Maximum Depth of Binary Tree [Trees] Problem: Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node. Note: A leaf is a node with no children. Example: Given binary tree [3,9,20,null,null,15,7], return its depth = 3. -Summary- Solve recursively 1. Find the maximum length of depth by comparing the left and right subtree. 2. Add 1 .. 2020. 6. 5. 이전 1 2 다음
