Inorder predecessor is the node which travelled before given node in inorder traversal of binary tree. In binary search tree, it's the previous big value before a node. ... If node is leftmost node in BST or least node, then there is no inorder predecessor for that node.