Leetcode Problem 814. Binary Tree Pruning

814. Binary Tree Pruning

Leetcode Solutions

Define a helper function containsOne(node) that returns True if the subtree rooted at node contains a 1, and False otherwise.
If node is null, return False.
Recursively call containsOne(node.left) and containsOne(node.right) to check the left and right subtrees.
If the left subtree does not contain a 1, prune it by setting node.left to null.
Similarly, if the right subtree does not contain a 1, prune it by setting node.right to null.
Return True if the current node's value is 1 or if either the left or right subtree contains a 1.
Call containsOne(root) from the main function pruneTree and return the potentially modified root.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen