Queries on BST

CodeChefOpen on judge ↗

Avengers need the secret code to get access to some encrypted files. The problem involves $N$ elements. The computer gives a number one by one and You have to insert them into Binary Search tree. Initially the BST is empty. After every insertion, print the height of the last inserted node. Note: - 1) Depth of the root node is $0$. 2) All the elements of the array are unique. ###Input: -

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