Balance a Binary Search Tree | Leetcode

This video explains how to balance a binary search tree. I have explained the about binary search tree properties initially and then explained the most optimal method to solve this problem using binary partition divide and conquer method. Important follow-up interview problems are discussed at the end of the video.
PDF of this video will be present on our Telegram channel.
🟢 TELEGRAM channel ( 𝐏𝐃𝐅 𝐨𝐟 𝐯𝐢𝐝𝐞𝐨): t.me/codewithTECHDOSE
🟣 JOIN our 𝐋𝐈𝐕𝐄 𝐢𝐧𝐭𝐞𝐫𝐯𝐢𝐞𝐰 𝐭𝐫𝐚𝐢𝐧𝐢𝐧𝐠 𝐩𝐫𝐨𝐠𝐫𝐚𝐦 through whatsapp query: [phone]
🟢 Our Services: techdose.co.in/
🔵 LinkedIn: / surya-pratap-kahar-47b...
👉🏼INSTAGRAM: / surya.pratap.k
𝐂𝐎𝐃𝐄 𝐋𝐈𝐍𝐊: gist.github.com/SuryaPratapK/...

[@MP-ny3ep]

Great explanation. Thank you

[@ventacode]

here for daily solution bud !1

[@techdose4u]

welcome :)

[@user-ok4fx3kl6f]

what is the size of array ie even ?

[@greenhawk271]

bhai ye to pta hi hota hai
you need to find the ans without using inorder
aise to bst ke saare que hote hi hai inorder se
interview mai aise allowed nai krte

[@sandevdias5721]

can we get the python code from this

[@artistic__08]

Why can we not do AVL rotations from bottom up ?

[@-_____-]

I think AVL rotations relies on invariants that are true to Balanced BSTs, but not all BSTs