I got some doubts while trying to apply AVL to some trees. This vdo made it clear... The imp point I was missing "start from a leaf and go towards the root. if u encounter an imbalance fix that first. Then only go upwards." Great explanation. Superb.
Sir ap k abhi tak jitne bhi study videos dekhe hai.. Sab me concept clear hue hai...mast padhate hai ap..apka concept clear hai..mughe jabhi koi topic samaghme nahi ata to apke videos search kerti hu per kabhi kabhi nahi milta hai,tension ata hai ki ab kiske videos dekhu jisse concept clear ho.. Well done sir thank you.
YOU ARE A BEING A BLESSING FOR US! Thankyou sir! Could you even please upload videos on red black tree and expression tree? And also microprocessor videos tooo! Eagerly waiting for you to respond.
Sir jaise aapne DBMS and OS k courses k start mein ek video banaya hai about the overview of the whole syllabus. Same type ka video apne Computer Networks k liye q nahi banaya? Please produce it. JazakAllah
thank you so much sir for kind information.I was trying to understand in class but i was not able to understand.You made this concept clear in just 12 mins wow thanks again sir lots of respect and love from nepal.💕🥰
Sir mujhe isko smjhne me itna time lg gya tha tb bhi smjh ni aya or apki itni si video ne meko pura smjha diya mene apki tino video dekhi they are awesome 👍.... please i want like from you
i paused the video to make the BST and converted it from the bottom though my whole tree looks different but i got the answer right 😅😅😅 only thing i was sure about is 3 left it made easy guess for me
Construct an AVL-tree (height balanced tree) for the following sequences of input : j a d n o s m f j k l Sir, i am unable to construct tree using these inputs, please tell me how can I construct correctly & also why input 'j' is written 2 times??