Deepest Leaves Sum Problem

Lakhankumawat / LearnCPP

Learn Cpp from Beginner to Advanced ✅ Practice 🎯 Code 💻 Repeat 🔁 One step solution for c++ beginners and cp enthusiasts.

https://lakhankumawat.github.io/LearnCPP/

MIT License

642 stars 490 forks source link

Deepest Leaves Sum Problem #1502

Closed Khushi-Mattu closed 2 years ago

Khushi-Mattu commented 2 years ago

Description

Question: Given the root of a binary tree, return the sum of values of its deepest leaves. Sample Input: root = [1,2,3,4,5,null,6,7,null,null,null,null,8] Sample Output: 15

Domain

Competitive Programming

Type of Contribution

Addition, Enhancement

Code of Conduct

[X] I follow Contributing Guidelines & Code of conduct of LearnCPP.

Khushi-Mattu commented 2 years ago

\assign

github-actions[bot] commented 2 years ago

Hello @Khushi-Mattu, thanks for creating your first issue at LearnCPP, hope you followed the guidelines.

Khushi-Mattu commented 2 years ago

/assign

github-actions[bot] commented 2 years ago

This issue has been assigned to Khushi-Mattu! It will become unassigned if it is not closed within 12 days. A maintainer can also add the pinned label to prevent it from being unassigned.