Find the Maximum Value in a Binary Tree Recursively
Company: Akuna Capital
Role: Software Engineer
Category: Software Engineering Fundamentals
Difficulty: medium
Interview Round: Technical Screen
Overview: Implement a recursive C++ traversal that returns the maximum value stored in a TreeNode binary tree. The solution preserves the reported null-pointer and `INT_MIN` behavior, handles negative-only trees, proves the subtree invariant, and analyzes linear work, call-stack depth, and empty-tree ambiguity.
Read the full Akuna Capital Software Engineer interview experience this question came from