Oracle

Deepest Leaves Sum — Last-Level Sum via BFS in O(n)

LeetCode 1302 (Medium) asked at Amazon and Oracle. Sum all node values at the deepest level of a binary tree using BFS level-order traversal in O(n) time and O(w) space.