Print BST elements in descending order without inorder traversal
Filed under Delhivery
The question
Given a Binary Search Tree, print its elements in sorted descending order without using standard inorder traversal.
No write-up yet. Related questions below have one.
Related Delhivery questions
Collected from public candidate posts and coding forums. Updated Nov 2026.