Get Premium

Leetcode 530. Minimum Absolute Difference in BST

Given the root of a BST, find the minimum absolute difference between values of any two different nodes. Use the BST property (in-order yields sorted values) and compare adjacent elements to compute the smallest gap.

Asked at:
Meta

Question Timeline

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

0

Mid March, 2025

Meta
Senior

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

Questions
Meta SWE Interview QuestionsAmazon SWE Interview QuestionsGoogle SWE Interview QuestionsOpenAI SWE Interview QuestionsAnthropic SWE Interview QuestionsEngineering Manager (EM) Interview Questions
Learn
Learn System DesignLearn DSALearn BehavioralLearn ML System DesignLearn Low Level DesignGuided Practice
Links
FAQPricingGift PremiumHello Interview Premium
Legal
Terms and ConditionsPrivacy PolicySecurity
Contact
About UsProduct Support

7511 Greenwood Ave North Unit #4238 Seattle WA 98103

© 2026 Optick Labs Inc. All rights reserved.

Leetcode 530. Minimum Absolute Difference in BST | Hello Interview