FIND LEVEL

CodeChefOpen on judge ↗

You are given a [CBT](https://www.programiz.com/dsa/complete-binary-tree#:~:text=A%20complete%20binary%20tree%20is,must%20lean%20towards%20the%20left.) (COMPLETE BINARY TREE) with $N$ nodes and $Q$ quires are asked. Find level at which node asked in quires is present. $NOTE:-$ Root of tree is at level 1. #Input: - First line will contain $T$, number of testcases. Then the testcases fo

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI