Given a binary search tree, you are asked to find the smallest difference between two different elements of the BST.
The input is handled automatically, you don’t need to do anything. All the values of the nodes are positive integers that don’t exceed . It’s guaranteed that the input BST tree is valid and has more than 2 nodes.
The program should print the minimum absolute smallest difference between two elements in the BST.