Understand what the interviewer is asking for by using test cases and questions about the problem.
- Established a set (2-3) of test cases to verify their own solution later.
- Established a set (1-2) of edge cases to verify their solution handles complexities.
- Have fully understood the problem and have no clarifying questions.
- Have you verified any Time/Space Constraints for this problem?
HAPPY CASE
Input: root = [3,9,20,null,null,15,7]
Output: 3
Input: root = [1,null,2]
Output: 2
EDGE CASE
Input: root = []
Output: 0
Match what this problem looks like to known categories of problems, e.g. Linked List or Dynamic Programming, and strategies or patterns in those categories.
If you are dealing with Binary Trees some common techniques you can employ to help you solve the problem:
Plan the solution with appropriate visualizations and pseudocode.
General Idea: Recursively ask for child height in tree and add one for parent.
1. Basecase is a Null Node, return 0
2. Recursively return the max between height of left node and right node and add one for current node.
⚠️ Common Mistakes
Implement the code to solve the algorithm.
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, val=0, left=None, right=None):
# self.val = val
# self.left = left
# self.right = right
class Solution:
def maxDepth(self, root: Optional[TreeNode]) -> int:
# Basecase is a Null Node, return 0
if not root:
return 0
# Recursively return the max between height of left node and right node and add one for current node.
return max(self.maxDepth(root.left), self.maxDepth(root.right)) + 1
class Solution {
public int maxDepth(TreeNode root) {
// Basecase is a Null Node, return 0
if(root == null) return 0;
// Recursively return the max between height of left node and right node and add one for current node.
return Math.max(maxDepth(root.left), maxDepth(root.right)) + 1;
}
}
Review the code by running specific example(s) and recording values (watchlist) of your code's variables along the way.
Evaluate the performance of your algorithm and state any strong/weak or future potential work.
Assume N
represents the number of nodes in binary tree
O(N)
, because we need to visit each node in the binary treeO(N)
because we need to account for unbalanced tree (space is used for the recursion stack). In the general case O(logN)
for balanced tree.