How should I practice Maximum Value in a Binary Tree?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Akuna Capital phone screen problems in FastPrep.

Is Maximum Value in a Binary Tree associated with Akuna Capital?

FastPrep tags this as a Akuna Capital phone screen coding practice problem when the problem catalog has that company and stage context.

Problem · Tree

Maximum Value in a Binary Tree

Learn this problem

● Easy

Akuna CapitalNEW GRADPHONE SCREEN

Problem statement

Given the root of a nonempty binary tree, return the maximum value stored in any node.

Your implementation must handle trees whose values are all negative.

Function

findMaximumValue(root: TreeNode) → int

Examples

Example 1

root = [3,1,5,null,2,4,8]return = 8

The largest node value is 8.

Example 2

root = [-8,-12,-3]return = -3

All values are negative, so the least negative value is the maximum.

Constraints

The tree contains from 1 through 10^5 nodes.
-10^9 <= Node.val <= 10^9.