day 17 第六章二叉树
今日内容:
● 110.平衡二叉树
● 257. 二叉树的所有路径
● 404.左叶子之和
class Solution:
def binaryTreePaths(self, root: Optional[TreeNode]) -> List[str]:
# 257 二叉树的所有路径
res = []
path = []
def trav(node):
path.append(node.val)
# print(path)
# 终止条件:叶子结点
if not node.left and not node.right:
s = ""
for m in range(len(path)-1):
s = s + str(path[m]) + "->"
s = s + str(path[-1])
# print(s)
res.append(s)
return
# 回溯
if node.left:
trav(node.left)
path.pop()
if node.right:
trav(node.right)
path.pop()
trav(root)
return res