代码随想录算法训练营第十六天 | 104.二叉树的最大深度、111.二叉树的最小深度、222.完全二叉树的节点个数-CSDN博客

本文链接：https://blog.csdn.net/Schwarzwald5987/article/details/135563831

本文介绍了如何使用递归方法计算二叉树的最大深度（从根到最远叶子节点的距离）和最小深度（根到最近叶子节点的距离），以及如何计算完全二叉树的节点总数。

摘要由CSDN通过智能技术生成

二叉树的最大深度

# 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 maxDepth(self, root: Optional[TreeNode]) -> int:
        return self.getDepth(root)

    def getDepth(self, node):
        if not node:
            return 0

        leftheight = self.getDepth(node.left)
        rightheight = self.getDepth(node.right)
        height =  1 + max(leftheight, rightheight)

        return height

二叉树的最小深度

最小深度即根节点到叶子结点的最短路径

# 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 minDepth(self, root: Optional[TreeNode]) -> int:
        return self.getDepth(root)

    def getDepth(self, node):
        if not node:
            return 0
        leftDepth = self.getDepth(node.left)
        rightDepth = self.getDepth(node.right)
        
        if node.left and not node.right:
            return 1 + leftDepth
        if not node.left and node.right:
            return 1 + rightDepth

        height = 1 + min(leftDepth, rightDepth)
        return height

完全二叉树的节点个数

# 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 countNodes(self, root: TreeNode) -> int:
        return self.getNodesNum(root)
        
    def getNodesNum(self, cur):
        if not cur:
            return 0
        leftNum = self.getNodesNum(cur.left) #左
        rightNum = self.getNodesNum(cur.right) #右
        treeNum = leftNum + rightNum + 1 #中
        return treeNum

参考文档：代码随想录