Easy Coding Interview Question! | Maximum Depth of Binary Tree - Leetcode 104

preview_player
Показать описание
leetcode, coding interview question, data structures, data structures and algorithms, faang
Рекомендации по теме
Комментарии
Автор

Master Data Structures & Algorithms For FREE at AlgoMap.io!

GregHogg
Автор

These are perfect for revising before an interview!

ravikiran
Автор

max (1+ max_depth(root.left), 1+max_depth(root.right))

rahuldwivedi
Автор

the root is a list
where does root.left and right came from ? !!!

Arash_Rayan
Автор

A rb tree this is annoying to implement.
But the funny thing is the AVL tree technically already caches this result.
Because it tries to balance in depth.

Speiger
Автор

It's like being back in collage 😊

ciobyk
Автор

what is the website? where can i find and solve these questions?

ramtin
Автор

The base case should return -1, not 0.

abdulahad
Автор

how about you fix the problem that is your squeaky voice

dkdkskrrt