Possible BSTs, BST Violations, and Balanced Parentheses
Filed under BankBazaar.com
The question
Given n distinct values, find how many BSTs are possible. Also, given an inorder traversal of a BST in an array, find relative pairs violating BST constraints, and print all possible pairs of balanced parentheses for a given n.
No write-up yet. Related questions below have one.
Related BankBazaar.com questions
Collected from public candidate posts and coding forums. Updated Nov 2026.