FunctionRacerProblemsRace

Smallest and Largest in a BST

BeginnerTreesPython, JavaScript, TypeScript, Java, C++

You are given the root of a binary tree. Return [smallest, largest] of the values in the BST. For an empty tree return []. You can find both by walking straight down one side each. In a binary search tree every value in a left subtree is smaller than its node and every value in a right subtree is larger.

Trees appear in the tests in level order, with null for a missing child, like [3,9,20,null,null,15,7]. Each node is a TreeNode with .val, .left and .right; the class is already defined for you.

Example 1

root [4,2,7,1,3]
returns [1,7]

Leftmost is 1, rightmost is 7.

Constraints

Race itor take your time

Write it in your browser, against the clock. The model solution, stepped through line by line, comes after.

More Trees problems