Linkedin Mülakat Sorusu – Maximum Depth of Binary Tree

LeetCode içerisinde bulunan “Maximum Depth of Binary Tree” sorusunun açıklaması ve çözümü. Bu soruda sizi verilen bir binary tree içerisinde, root node‘undan en uzaktaki leaf node‘una olan uzaklığı bulmanız isteniyor.

► LeetCode 104. Maximum Depth of Binary Tree: https://leetcode.com/problems/maximum-depth-of-binary-tree/

► Problem açıklaması:

Given the root of a binary tree, return its maximum depth.

A binary tree’s maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

Example 1:

Input: root = [3,9,20,null,null,15,7]

Output: 3

Example 2:

Input: root = [1,null,2]

Output: 2

Example 3:

Input: root = []

Output: 0

Example 4:

Input: root = [0]

Output: 1

Constraints:

The number of nodes in the tree is in the range [0, 10^4].

-100 <= Node.val <= 100

Leave a Reply

This site uses Akismet to reduce spam. Learn how your comment data is processed.