Видео

Thank you sir ❤

❤

Thank you sir❤

Super crystal clear

Hats off to your dedication sir

tq so much sir

11:08

Square & pointed.

2

nanban

sir i am very lucky to watch your videos😀

best explAINED

Thank you sir❤

Amazing Explanation. Best video on this topic

Hii sdm😂

Sir, can u explain how u got these bounding functions in the first place?

Isn't it postfix expression table and atlast we reverse to get prefix? So postfix should be written where prefix is written

GOAT

GOAT

Thank you for the explanation.

This was really helpful. Thank you sir🫡

thank you teacher

thanks sir

And further, for efficiency, when the tree gets large, it is a good idea to get the sorted result, take the mid value point, as the new top node, then rebuild the other tree nodes balancing the left and right. branches.

Maybe useful to show deletion of nodes. Because adding is very easy. But deletion is more tricky.

I was the first to use threaded binary tree in my company in 1984. To create a database for microfiche indexing. Using "abvanced basic" in msdos, before windows even existed. On floppy discs. Imagine.

thank you, sir

tu haai toh dill dhadktaa hai🤌 What an explanation!

thank you sir for these videos

Indebted to you forever , thank you 🛐

Sir give me the link of the notes sir 🙏

L is not mentioned in the algo to be able to swap A[L] at 28:15

Tomorrow is my daa exam and this guy single handedly saved me. Thanks man appreciate it.

Thank you sir

Sir pls make lectures on networks and toc🙏🙏🙏

Jai Hind Jai karnataka jai kannada ❤

Such a wonderful lecturer 😊

❤

Thank you for the beautiful class sir ❤

You are amazing sir ❤ wish I had u as my teacher ❤😢

nice sir

best explanation in youtube amazing keep up the good work

Nyc explanation sir🙏

why was d not considered

sir your lecture helping me a lot wonderful teaching style

sir P, NP, and NP-Complete Problems, please

thank you sir

thank u sir 👍

Thank you so much sir it was very helpful

Global academy of Technology