A node predecessor is the right most node of the left subtree of a binary search tree. The predecessor cannot have a right child as then it would not be the predecessor.
A node predecessor is the right most node of the left subtree of a binary search tree. The predecessor cannot have a right child as then it would not be the predecessor.