โ† Infosys questions

Implement BST and Find Depth

Filed under Infosys

Implement a Binary Search Tree (BST) and write a function to find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Infosys questions

Collected from public candidate posts and coding forums. Updated Nov 2026.