BST validation, max element, and inorder successor/predecessor
Filed under Thoughtworks
The question
Explain BST concepts, verify if a given binary tree is a BST, find the maximum element in a BST, and find the inorder successor and predecessor for a given number which may or may not be in the BST.
No write-up yet. Related questions below have one.
Related Thoughtworks questions
Collected from public candidate posts and coding forums. Updated Nov 2026.