Leaf nodes to doubly-linked cycle and BST check
Filed under Myntra
The question
Given a tree, take its leaf nodes and form a doubly-linked cycle, then print the cycle. Also, determine whether a given binary tree is a valid Binary Search Tree (BST).
No write-up yet. Related questions below have one.
Related Myntra questions
Collected from public candidate posts and coding forums. Updated Nov 2026.