CPMagical CP Library

Problem solution · Python

Count Good Nodes in Binary Tree

Count Good Nodes in Binary Tree: a Python solution using depth-first search. Learn the idea, check the complexity, and read the full code, with credit to Kamyu LeetCode Solutions.

Technique
Depth-first search
Source
Kamyu LeetCode Solutions
Length
47 lines
Start with the idea.

Try the problem first. If you get stuck, read the approach below, then write your own solution. The full code is at the bottom.

Approach

Depth-first search

For Count Good Nodes in Binary Tree, the implementation follows one branch at a time, making it suitable for components, trees, backtracking, or dependency exploration.

  1. Define the state carried into one recursive or stack frame.
  2. Mark or choose the current state before exploring children.
  3. Combine child results or undo the choice when the branch finishes.

Code notes

  • 47 lines of Python from the credited upstream file count-good-nodes-in-binary-tree.py.
  • The implementation keeps its working state in language-native values and containers.
  • No explicit loop blocks detected, together with recursive traversal.

Complexity

Count unique states for graph traversal; for backtracking, count the branching factor and maximum depth.

Check the problem constraints before deciding whether this complexity will pass.

Source

Code and credit

This code comes from Kamyu LeetCode Solutions by kamyu104 and is used under the MIT licence.

Open problem ↗Original source ↗
Full codeCount Good Nodes in Binary Tree · PythonPython
Use this to learn the idea, then write your own version.
# Time:  O(n)# Space: O(h) # Definition for a binary tree node.class TreeNode(object):    def __init__(self, val=0, left=None, right=None):        self.val = val        self.left = left        self.right = right  class Solution(object):    def goodNodes(self, root):        """        :type root: TreeNode        :rtype: int        """        result = 0        stk = [(root, root.val)]        while stk:            node, curr_max = stk.pop()            if not node:                continue            curr_max = max(curr_max, node.val)            result += int(curr_max <= node.val)            stk.append((node.right, curr_max))            stk.append((node.left, curr_max))        return result  # Time:  O(n)# Space: O(h)class Solution2(object):    def goodNodes(self, root):        """        :type root: TreeNode        :rtype: int        """        def dfs(node, curr_max):            if not node:                return 0            curr_max = max(curr_max, node.val)            return (int(curr_max <= node.val) +                    dfs(node.left, curr_max) + dfs(node.right, curr_max))                return dfs(root, root.val)

Keep practising

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗