Data Structures for Coding Interviews in Java/

...

/

Challenge: Find Minimum Value in Binary Search Tree

Challenge: Find Minimum Value in Binary Search Tree

Try to solve the Find Minimum Value in Binary Search Tree problem.

We'll cover the following...

Statement

Given the root node of a binary search tree (BST), find and return the minimum value present in the BST.

Constraints:

Let n be the number of nodes in a binary search tree.

  • 0≤0 \leq n ≤500\leq500

  • −104≤-10^4\leq Node.data ≤104\leq10^4

Examples

Access this course and 1400+ top-rated courses and projects.