Python Programming Practice: LeetCode #104 -- Maximum Depth of Binary Tree

Показать описание

In this episode of Python Programming Practice: LeetCode #104 -- Maximum Depth of Binary Tree

Link to the problem here:

Python Programming Practice is a series focused on teaching practical coding skills by solving exercises on popular coding websites. Note that the solutions seen here may not be the most efficient possible.

I am not going to provide the full code in the video description for this series, since copy and pasting solutions is not in the spirit of doing coding exercises. It is intended that the video will help you think about problems, approaches and how to structure solutions so that you are able to code up a working solution yourself. .

Рекомендации по теме

Комментарии

best explanation for beginners on youtube! love how you walk us through the steps

davidguo

My initial approach was to set pointers for left and right and use a while loop to add plus one until there is no left or right child left, but I can not find a proper way to code that.

marianpascu

class Node:
def __init__(self, data) -> None:
self.data=data
self.left=self.right=None

depth=0
l=[]

def max_depth(root, l, depth):
if root is None:
return
if root.left is None and root.right is None:
l.append(depth)
return
else:
depth+=1
max_depth(root.left, l, depth)
max_depth(root.right, l, depth)

root=Node(9)
root.left=Node(10)
root.right=Node(7)
root.right.left=Node(1)
root.right.right=Node(2)

max_depth(root, l, depth)
print(max(l))

dipesh

Python Programming Practice: LeetCode #104 -- Maximum Depth of Binary Tree

Python Programming Practice: LeetCode #104 -- Maximum Depth of Binary Tree

Maximum Depth of Binary Tree - 3 Solutions - Leetcode 104 - Python

Maximum Depth of Binary Tree - Leetcode 104 - Python

LeetCode 104: Maximum Depth of Binary Tree [Python]

Maximum Depth of Binary Tree | Leet code 104 | Theory explained + Python code

LeetCode #104 Height of Binary Tree(Max Depth) - Python Interview Question(Recursion)

Leetcode 104. Maximum Depth of Binary Tree (Python)

Leetcode # 104. Maximum Depth of Binary Tree (Python Recursive and Iterative)

leetcode Practice Day104#Python#leetcode#365days

Maximum Depth of Binary Tree - LeetCode 104 - Python

How to solve (almost) any binary tree coding problem

LeetCode Maximum Depth of Binary Tree | Recursion | Python

Operations on Tree - Leetcode Biweekly Contest - 1993 - Python

Leetcode - Minimum Depth of Binary Tree (Python)

Leetcode - Maximum Width of Binary Tree (Python)

Maximum Depth of Binary Tree | LeetCode 104 | C++, Java, Python

Maximum Depth of Binary Tree - Leetcode 104 - Python

Maximum Depth Of Binary Tree | Leetcode Python Solution | Python

Leetcode - Flip Binary Tree To Match Preorder Traversal (Python)

Leetcode 104: Maximum depth of a binary tree (Python)

Guess Number Higher or Lower - Leetcode 374 - Python

Maximum Depth of Binary Tree Leetcode 104. Learn BFS and DFS in 2 minutes with complete Code

The trick to solve any recursion problem in programming...

Use Python when solving leetcode problems #python #java