LeetCode Experience

#530 Minimum Absolute Difference in BST

Interview Experience

LeetCode #530: Minimum Absolute Difference in BST. Difficulty: Easy. Topics: Tree, Depth-First Search, Breadth-First Search, Binary Search Tree, Binary Tree. Asked at Amazon in the last 6 months.

Original Source

This is a frequency-tagged signal. The full problem statement lives on the original source.

View original →

Topics

Binary Search Tree Binary Tree Breadth-First Search Depth-First Search Tree Binary Search Binary Tree Graph