首页 > itarticle > algorithm notes: leetcode#104 maximum depth of binary tree

algorithm notes: leetcode#104 maximum depth of binary tree

admin 11月 12, 2020 0

Problem

Solution

Analysis

Python implementation

# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None
class :
    def maxDepth(self, root):
        """
        :type root: TreeNode
        :rtype: int
        """
        if root is None:
            return 0
        return max(self.maxDepth(root.left), self.maxDepth(root.right)) + 1

Java implementation

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class  {
    public int maxDepth(TreeNode root) {
        if(root == null){ return 0; }
        int leftDepth = maxDepth(root.left);
        int rightDepth = maxDepth(root.right);
        return (leftDepth > rightDepth ? leftDepth : rightDepth) + 1;
    }
}

Time complexity

O(N).

Space complexity

O(N).

Links

104. Maximum Depth of Binary Tree
(中文版) 算法笔记: 力扣#104 二叉树的最大深度