Data Structures for Coding Interviews in C#/

...

/

Challenge 1: Finding Minimum Value in a Binary Search Tree

Challenge 1: Finding Minimum Value in a Binary Search Tree

Given the root to a binary search tree, write a function to find the minimum value in that tree.

We'll cover the following...

Problem statement

Implement the int findMin(Node* rootNode) function, which will find the minimum value in a given binary search tree. Remember that a binary search tree is a binary tree that satisfies the following property:

...