Amazon Mülakat Sorusu – Deepest Leaves Sum

LeetCode içerisinde bulunan “Deepest Leaves Sum” sorusunun açıklaması ve çözümü. Bu soruda size verilen bir binary tree‘nin en dipteki node’larının (leave) toplamını geri döndürmeniz isteniyor.

► LeetCode 1302. Deepest Leaves Sum:

► Problem açıklaması:

Given the root of a binary tree, return the sum of values of its deepest leaves.

Example 1:

Input: root = [1,2,3,4,5,null,6,7,null,null,null,null,8]

Output: 15

Example 2:

Input: root = [6,7,8,2,7,1,3,9,null,1,4,null,null,null,5]

Output: 19


The number of nodes in the tree is in the range [1, 104].

1 <= Node.val <= 100

Leave a Reply

Your email address will not be published. Required fields are marked *

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