← OYO questions

Modified binary tree preorder, perfect squares count, and square root

Filed under OYO

Given a binary tree where null pointers are replaced by pointers to the node itself, perform a preorder traversal. Also, count perfect squares in range [a, b] and implement integer square root without…

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

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