โ† Informatica questions

Floor and Ceil from a BST

Filed under Informatica

Find the floor and ceil of a given key in a Binary Search Tree. Floor is the largest node value <= key; Ceil is the smallest node value >= key.

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

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