/css/ - CSS Masters

Ever felt like navigating through a multi-story building? Well that’s kinda what exploring binary trees can feel like. But instead of floors, we got nodes with values and our mission is to find out which level has the highest score Problem Summary: You're given a root node for an ol' trusty btree (with integers) where each new branch starts at Level 1 - just remember its kids are on Levels higher than that. So, we need some solid strategy here to visit one floor/level at time and count up the points! Got any tips or thoughts? Let me know how you'd approach this interesting challenge

Source: https://dev.to/om_shree_0709/beginner-friendly-guide-maximum-level-sum-of-a-binary-tree-leetcode-1161-c-python-1383