Delete Leaves With Target Value In Binary Tree
Delete leaf nodes with value target in binary tree: recursively traverse and remove nodes where `val == target` and both children are null, until no more nodes meet this condition.
1325. Delete Leaves With a Given Value Medium Given a binary tree root and an integer target, delete all the leaf nodes with value target. Note that once you delete a leaf node with value target, if its parent node becomes a leaf node and has the value target, it should also be deleted (you need to continue doing that until you cannot). Example 1: Input: root = [1,2,3,2,null,2,4], target = 2 Output: [1,null,3,null,4] Explanation: Leaf nodes in green with value (target = 2) are removed (Picture in left). After removing, new nodes become leaf nodes with value (target = 2) (Picture in center)....