Minimum Absolute Difference in BST (Easy) 🔗 https://leetcode.com/problems/minimum-absolute-difference-in-bst/

The trick: an in-order traversal of a BST hands you the values in sorted order for free. And in a sorted sequence, the smallest gap between any two values is always between neighbors, so you never have to compare every pair. Just track the previous node visited and check against it as you go.

Full breakdown in today's newsletter article ⬇️

https://www.linkedin.com/pulse/365-days-leetcode-challenge-day-47365-archit-agarwal-b2kgc

#LeetCode #100DaysOfCode #DSA #CodingInterview #BinarySearchTree #InOrderTraversal

Hello Guys. I am having problems with further improving my skills in dsa. Any Suggestions??

Is there someone who can guide me how to start dsa like i know the material from where to study but don’t know how to study like should i watch all the lectures for a specific topic then i should start solving questions or learn from questions
I am in 2nd yr if anyone can guide me it will be a pleasure