Unit 8 Session 1 Advanced (Click for link to problem statements)
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?
threshold
.HAPPY CASE
Input: Binary tree with nodes [100, 1200, 1500, 20, 700, 2600], threshold = 1000
Output: 3
Explanation: The nodes with values 1200, 1500, and 2600 are considered old growth trees.
EDGE CASE
Input: Binary tree with only one node [500], threshold = 1000
Output: 0
Explanation: The only node does not meet the threshold, so the count is 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.
For Tree Count problems, we want to consider the following approaches:
Plan the solution with appropriate visualizations and pseudocode.
General Idea: Traverse the tree recursively, counting nodes with values greater than the given threshold.
1) If the current node is None, return 0.
2) Recursively count old growth trees in the left subtree.
3) Recursively count old growth trees in the right subtree.
4) If the current node's value is greater than the threshold, add 1 to the total count.
5) Return the total count of old growth trees.
⚠️ Common Mistakes
Implement the code to solve the algorithm.
class TreeNode:
def __init__(self, value, left=None, right=None):
self.val = value
self.left = left
self.right = right
def count_old_growth(root, threshold):
if root is None:
return 0
# Recursively count old growth trees in the left and right subtrees
left_count = count_old_growth(root.left, threshold)
right_count = count_old_growth(root.right, threshold)
# Check if the current node is an old growth tree
if root.val > threshold:
return 1 + left_count + right_count
else:
return left_count + right_count
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 the binary tree.
O(N)
because the algorithm needs to visit every node in the tree.O(H)
where H
is the height of the tree, due to the recursive call stack.