Problem 783 · Easy

Minimum Distance Between BST Nodes

An in-order walk visits values in sorted order, so the minimum difference is between consecutive visits.

Open the interactive visualisation