题目来源&＃xff1a;
https://leetcode.com/problems/minimum-depth-of-binary-tree/
题意分析&＃xff1a;
返回一颗二叉树从根部到叶子的最低高度。
题目思路&＃xff1a;
如果根节点为空&＃xff0c;那么返回0&＃xff0c;如果左子树为空&＃xff0c;返回右子树的最低高度&＃43;1&＃xff0c;右子树为空&＃xff0c;返回左子树最低高度&＃43;1&＃xff0c;否则返回min(左子树最低高度&＃xff0c;右子树最低高度&＃xff09;&＃43;1.
代码&＃xff08;python&＃xff09;&＃xff1a;
# Definition for a binary tree node.
# class TreeNode(object):
# def __init__(self, x):
# self.val &＃61; x
# self.left &＃61; None
# self.right &＃61; Noneclass Solution(object):def minDepth(self, root):""":type root: TreeNode:rtype: int"""if root &＃61;&＃61; None:return 0l,r &＃61; self.minDepth(root.left),self.minDepth(root.right)if l !&＃61; 0 and r !&＃61; 0:return min(l,r) &＃43; 1if l &＃61;&＃61; 0:return r &＃43; 1return l &＃43; 1
京公网安备 11010802041100号