โ† Oracle questions
CodingReported in a candidate post, Sep 2025

Sum of values at the deepest level of a binary tree

Filed under Oracle

Given the root of a binary tree, return the sum of the values of all nodes on its deepest level. Note this is not the sum of all leaves: a leaf on a shallower level is excluded.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Oracle questions

Collected from public candidate posts and coding forums. Updated Nov 2026.