@@vuconcepts gg sir sir ap Sy ik request hai please sir Jo practical ka Papar ho gye 15 ko cs 301p ka oc ki viedo bna dijiga please sir Mera 16 ko papar hai practical ka
We mostly prefer recursion when there is no concern about time complexity and the size of code is small. We prefer iteration when we have to manage the time complexity and the code size is large. It has high time complexity. The time complexity is lower as compared to recursion.
Thanku sir
Sir!! Interesting method of teaching.
God bless you.
Jazak Allah.
keep it up sir you make it very easy to under stand .
Keep watching
Thanks sir
All the best
Thanku u sir ❤️❤️
Share with others.
@@vuconcepts yeah I did 😌❤️
Thanks sir 🙂
Welcome. Keep watching!
@@vuconcepts gg sir sir ap Sy ik request hai please sir Jo practical ka Papar ho gye 15 ko cs 301p ka oc ki viedo bna dijiga please sir Mera 16 ko papar hai practical ka
We ll try InshAllah
@@vuconcepts ok please zaror zaror sir g
Assalamualaikum sir cs301 and cs301p different ha ya same
Dono Same he hain lakin inka Syllabus different ha.
Sir Iteration recursion sy zyada efficient nhi ha kya?
Google py to yhi likha ha
We mostly prefer recursion when there is no concern about time complexity and the size of code is small. We prefer iteration when we have to manage the time complexity and the code size is large. It has high time complexity. The time complexity is lower as compared to recursion.
@@vuconcepts so that means iteration is more efficient, because it has low time complexity.
@@yousafsabir7 yes, when thecode size is large.
❤
AVL tree kay four cases han ap nay BST ka batya ha
@@Aysh313 Timestamp?
@@vuconcepts 11 minute
@@Aysh313 sir ne avl tree ke nahi deletion on avl tree ke cases batay hain jo ke 3 cases hi hain. for verification please check your handouts.