leetle

Daily challenge for 2026-06-28

544. Find the Deepest Rightmost Node

Given an array representation of a binary tree (where null represents an empty node), find the value of the rightmost node at the deepest level of the tree. If the tree is empty, return null.

Example:
Input: tree = [1, 2, 3, 4, 5, null, 6]
Output: 6

Run this challenge interactively in Python or JavaScript when the app loads.