110.平衡二叉树
递归法
思路:
1.确定递归参数和返回值:输入root,输出高度或是否平衡
2.终止条件:遇到None,return 0
3.单层逻辑:左边高度,右边高度,中间 =1+max(左高,右高)
class Solution:
def isBalanced(self, root: Optional[TreeNode]) -> bool:
if self.getHeight(root) !=-1:
return True
else:
return False
def getHeight(self,root):
if not root:
return 0
leftHeight = self.getHeight(root.left)
rightHeight = self.getHeight(root.right)
if leftHeight==-1 or rightHeight==-1 or abs(leftHeight-rightHeight)>1:
return -1
else:
return max(leftHeight,rightHeight)+1
257.二叉树的所有路径
叶子节点 是指没有子节点的节点。
递归法
思路:
中左右
1.确定递归参数和返回值:输入root,记录每一条路径的path,和存放结果集的result,这里递归不需要返回值
2.终止条件:遇到左右子树均为空,return 0
3.单层逻辑:需要先处理中间节点,先放进path中,再左右
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, val=0, left=None, right=None):
# self.val = val
# self.left = left
# self.right = right
class Solution:
def binaryTreePaths(self, root: Optional[TreeNode]) -> List[str]:
result = []
path = ''
if not root:
return result
self.travelsal(root,path,result)
return result
def travelsal(self,cur,path,result):
path += str(cur.val)
if not cur.left and not cur.right:
result.append(path)
if cur.left:
self.travelsal(cur.left, path+'->',result)
if cur.right:
self.travelsal(cur.right, path+'->',result)
404.左叶子之和
左叶子节点:节点A的左孩子不为空,且左孩子的左右孩子都为空(说明是叶子节点),那么A节点的左孩子为左叶子节点
递归法
思路:
1.确定递归参数和返回值:输入root,左叶子
2.终止条件:遇到左叶子为空,return 当前sum
3.单层逻辑:左和,右和,中=(当前左叶子节点值 +左和 +右和)
class Solution:
def sumOfLeftLeaves(self, root: Optional[TreeNode]) -> int:
if not root:
return 0
leftSum = self.sumOfLeftLeaves(root.left)
rightSum = self.sumOfLeftLeaves(root.right)
curleft = 0
if root.left and not root.left.left and not root.left.right:
curleft = root.left.val
return curleft + leftSum + rightSum
迭代法
class Solution:
def sumOfLeftLeaves(self, root: Optional[TreeNode]) -> int:
if not root:
return 0
que = [root]
result = 0
while que:
cur = que.pop()
if cur.left and not cur.left.left and not cur.left.right:
result += cur.left.val
if cur.left:
que.append(cur.left)
if cur.right:
que.append(cur.right)
return result