此题是关于树的题目,自然想到递归,关于判断的顺序,自己想一个简单的例子0->0 0>0往里面一带就能发现错误。
hint:
python没有&& 和 || ,是 and 和 or
附代码
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
def pruneTree(self, root):
"""
:type root: TreeNode
:rtype: TreeNode
"""
if root == None:
return None
else:
root.left = self.pruneTree(root.left)
root.right = self.pruneTree(root.right)
if root.left == None and root.right == None and root.val == 0:
return None
return root