[LeetCode] Top Interview 150 Problems Solving # 530 Minimum Absolute Difference in BST
Understanding the Problem A binary tree is given as root. It can go both left and right, or only left or only right. It is to return the minimum difference between the nodes. It should be an absolute number though. As an example, if there is a tree t...