Given a binary search tree and a node in it, find the in-order predecessor of that node in the BST.
Note: If the given node has no in-order predecessor in the tree, return null.
Solution: Please check the main.js snippet for the solution. If you have different approach in mind or have any suggestion for this implementation feel free to share in the comment below. Thanks!