Скачать или смотреть LeetCode 1161 Maximum Level Sum of a Binary Tree - Using Breadth First Traversal And Queue

If you find this video helpful, please 'Like' or 'Subscribe'.
This is really helpful for the channel and also motivates me to do more of such good videos.

1161. Maximum Level Sum of a Binary Tree LeetCode - Using Breadth First Traversal And Queue

We are traversing complete binary tree and using Queue to hold TreeNodes.

Time Complexity: O(N)
Space Complexity: O(N)

Link To The Problem: https://leetcode.com/problems/maximum...

Problem Description:
Given the root of a binary tree, the level of its root is 1, the level of its children is 2, and so on.

Return the smallest level x such that the sum of all the values of nodes at level x is maximal.

Youtube channel:    / @maksrane100  

https://github.com/maksrane100/leetco...

#coding #softwareengineer #Leetcode #Algorithm #DataStructure #Java #programmer #tech #software #codinglife #Preparation
#interview #programminglife #programmingisfun