Leetcode 783. Minimum Distance Between BST Nodes

Given a BST root, return the minimum absolute difference between values of any two nodes; because an in-order traversal yields sorted values, the answer is the smallest gap between consecutive nodes in that ordering.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 783. Minimum Distance Between BST Nodes

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact