← Flipkart questions
CodingMedium

Validate binary search tree and find kth smallest element

Filed under Flipkart

Given the root of a binary tree, write a function to validate if it is a Binary Search Tree (BST). Then, implement a function to find the kth smallest element in the BST.

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 Flipkart questions

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