Let Code Day7 starting from zero "104. Maximum Depth of Binary Tree"

Overview

It seems that coding tests are conducted overseas in interviews with engineers, and in many cases, the main thing is to implement specific functions and classes according to the theme.

As a countermeasure, it seems that a site called Let Code will take measures.

A site that trains algorithmic power that can withstand coding tests that are often done in the home.

I think it's better to have the algorithm power of a human being, so I'll solve the problem irregularly and write down the method I thought at that time as a memo.

Leetcode

Basically, I would like to solve the easy acceptance in descending order.

Last time Leet Code Day6 Starting from Zero "1342. Number of Steps to Reduce a Number to Zero"

It lasted for a week without skipping. Congratulations.

problem

104. Maximum Depth of Binary Tree

It's a fairly early problem, but I felt it was a good problem to understand the structure of the binary tree.

Given a binary tree, you will be asked to write an algorithm that finds the maximum value for that depth.

example:
Given binary tree [3,9,20,null,null,15,7],

    3
   / \
  9  20
    /  \
   15   7
return its depth = 3.
# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    def maxDepth(self, root: TreeNode) -> int:
        depth = 0
        stack = [(root,1)]
        
        while stack:
            root,length = stack.pop()
            if not root:
                return 0
            
            if length > depth:
                depth = length
            if root.right:
                stack.append((root.right,length + 1))
            if root.left:
                stack.append((root.left,length + 1))
        return depth
# Runtime: 40 ms, faster than 70.51% of Python3 online submissions for Maximum Depth of Binary Tree.
# Memory Usage: 14.9 MB, less than 90.62% of Python3 online submissions for Maximum Depth of Binary Tree.

Written in a depth-first search as described in the previous problem with binary search trees, Leet Code Day4 "938. Range Sum of BST" starting from zero Saw.

I found out by looking it up on Discuss etc., but there is also such a way of writing.

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

from collections import deque

class Solution:
    def maxDepth(self, root: TreeNode) -> int:
        if not root:
            return 0
        queue = deque([(root, 1)])
        while queue:
            curr, val = queue.popleft()
            if not curr.left and not curr.right and not queue:
                return val
            if curr.left:
                queue.append((curr.left, val+1))
            if curr.right:
                queue.append((curr.right, val+1))
# Runtime: 36 ms, faster than 89.87% of Python3 online submissions for Maximum Depth of Binary Tree.
# Memory Usage: 15 MB, less than 90.62% of Python3 online submissions for Maximum Depth of Binary Tree.

It is implemented using deque.

Deque is a generalization of stacks and queues (the name is pronounced "deck", which is an abbreviation for "double-ended queue"). Deques can be append and pop from either side, are thread-safe and memory-efficient, and can run with approximately O (1) performance from either direction.

It's as fast as it sounds. Actually, the Runtime is also faster than other answers.

Recommended Posts

Let Code Day7 starting from zero "104. Maximum Depth of Binary Tree"
Let Code Day 44 "543. Diameter of Binary Tree" starting from zero
Let Code Day49 starting from zero "1323. Maximum 69 Number"
Let Code Day18 starting from zero "53. Maximum Subarray"
Let Code Day83 Starting from Zero "102. Binary Tree Level Order Traversal"
Let Code Day 23 "226. Invert Binary Tree" starting from scratch
Let Code Day 40 Starting from Zero "114. Flatten Binary Tree to Linked List"
Let Code Day45 Starting from Zero "1379. Find a Corresponding Node of a Binary Tree in a Clone of That Tree"
Let Code Day 26 starting from scratch "94. Binary Tree Inorder Traversal"
Let Code Day12 Starting from Zero "617. Merge Two Binary Trees"
Let Code Day 37 Starting from Zero "105. Construct Binary Tree from Preorder and Inorder Traversal"
Let Code Day87 Starting from Zero "1512. Number of Good Pairs"
Let Code Day56 Starting from Zero "5453. Running Sum of 1d Array"
Let Code Day92 Starting from Zero "4. Median of Two Sorted Arrays"
Let Code Day 35 "160. Intersection of Two Linked Lists" Starting from Zero
Let Code Day58 Starting from Zero "20. Valid Parentheses"
Let Code Day 27 "101. Symmetric Tree" starting from scratch
Let Code Day16 Starting from Zero "344. Reverse String"
Let Code Day89 "62. Unique Paths" Starting from Zero
Let Code Day 55 "22. Generate Parentheses" Starting from Zero
Let Code Table of Contents Starting from Zero
Let Code Day 13 "338. Counting Bits" Starting from Zero
Let Code Day71 Starting from Zero "1496. Path Crossing"
Let Code Day 61 "7. Reverse Integer" starting from zero
Let Code Day 82 "392. Is Subsequence" Starting from Zero
Let Code Day51 Starting from Zero "647. Palindromic Substrings"
Let Code Day 50 "739. Daily Temperatures" Starting from Zero
Let Code Day 15 "283. Move Zeroes" starting from zero
Let Code Day14 starting from zero "136. Single Number"
Let Code Day 9 "701. Insert into a Binary Search Tree" starting from scratch
Let Code Day 11 Starting from Zero "1315. Sum of Nodes with Even-Valued Grandparent"
Let Code Day6 Starting from Zero "1342. Number of Steps to Reduce a Number to Zero"
Let Code Day 43 "5. Longest Palindromic Substring" Starting from Zero
Let Code Day74 starting from zero "12. Integer to Roman"
Let Code Day 42 "2. Add Two Numbers" Starting from Zero
Let Code Day57 Starting from Zero "35. Search Insert Position"
Let Code Day47 Starting from Zero "14. Longest Common Prefix"
Let Code Day78 Starting from Zero "206. Reverse Linked List"
Let Code Day73 Starting from Zero "1491. Average Salary Excluding the Minimum and Maximum Salary"
Let Code Day10 Starting from Zero "1431. Kids With the Greatest Number of Candies"
Let Code Day 64 starting from zero "287. Find the Duplicate Number"
Let Code Day 84 starting from zero "142. Linked List Cycle II"
Let Code Day24 Starting from Zero "21. Merge Two Sorted Lists"
Let Code Day2 Starting from Zero "1108. Defanging an IP Address"
Let Code Day70 Starting from Zero "295. Find Median from Data Stream"
Let Code Day 38 starting from scratch "208. Implement Trie (Prefix Tree)"
Let Code Day81 "347. Top K Frequent Elements" Starting from Zero
Let Code Day4 starting from scratch "938. Range Sum of BST"
Let Code Day48 Starting from Zero "26. Remove Duplicates from Sorted Array"
Let Code Day 60 starting from zero "1481. Least Number of Unique Integers after K Removals"
Let Code Day 29 "46. Permutations" starting from scratch
Let Code Day67 Starting from Zero "1486. XOR Operation in an Array"
Let Code Day86 Starting from Zero "33. Search in Rotated Sorted Array"
Let Code Day5 starting from zero "1266. Minimum Time Visiting All Points"
Let Code Day54 Starting from Zero "1290. Convert Binary Number in a Linked List to Integer"
Let Code Day72 Starting from Zero "1498. Number of Subsequences That Satisfy the Given Sum Condition"
Let Code Day 41 "394. Decode String" starting from scratch
Let Code Day 25 "70. Climbing Stairs" starting from scratch
Let Code Day69 starting from scratch "279. Perfect Squares"
Let Code Day 34 starting from scratch "118. Pascal's Triangle"
Let Code Day85 starting from scratch "6. ZigZag Conversion"