MCQS maximum PARADOX ki mcqs website se thy, eik short me tree or uski bits given thi , bits ko tree se match kr ke word btana tha jo bnta tha, eik short or long me code given tha uska algorithm btana tha kn sa use use hua, eik short me BST ko AVL tree me convert krna tha, Eik short me AVL tree balance krna tha, Eik long me AVL max heap ka tree given tha usme eik max heap 70 insert krni thi, eik union wala tha usme array ko given union data ke according update krna tha, OverAll booht asan tha.