Python Program To Implement Binary Search Tree | Program 4 | Pre-Order Traversal Algorithm

[@martinflavell3045]

these tutorials are UNREAL! What a teacher!

[@kmishy]

I was facing lots of problem in implementation of recursive function, but now it is no more a problem. Ma'am explained everything in a precise manner

[@tareqoweinat5952]

best Binary tree search explanation i have seen in KZbin. thank you

[@AnuragKharade]

Mam your teaching is really a next level I didn't has words for this but please like mam my comment🥺🥺🥺

[@adebayoogunmoriyele5497]

I love how you explained everything. Looking forward to seeing your Linked list video

[@gopichandsani2234]

Super explanation .I Watched many videos to learn Binary Tree Topic but i didn't understand until i watched this videos

[@ThanhNguyen-is4uj]

What an explanation! Thank you for clearing my doubt.

[@vrindavaneshwari_ju_ki_kripa]

kitna acche se smjhayi ho didi ..tysm

[@meditationmusicvideosposit4620]

1.Write a program to print the natural numbers from 1 to 100. 2. Write a program to print the natural numbers from 100 to 1. 3. Write a program to print all the even numbers from 1 to 100. 4. Write a program to print all the odd numbers from 100 to 1. 5. Write a program to print all the even or odd number upto the given range.6. Write a program to print all the leap year between the given range. 7.write a program to print all the number which are neither divisible by 5 or 7 between the given range. 8.Write a program to print the table of 6. 9. Write a program to print the multiple table of a given number. 10. Write a program to print multiplication table from 1 to 10. 11. Write a program to print the factorial of a given number. 12. Write a program to print all the factors of a given number. 13. Write a program to check whether the given number is perfect or not. 14. Write a program to print all the perfect numbers up to the given range. 15. Write a program to check whether the given number is prime or not. 16. Write a program to generate all the prime numbers upto the given range. 17.write a program to input a number and print it in reverse order. 18. Write a program to check whether the given number is pallindrome or not. 19. Write a program to print all the pallindrome numbers between the given range. 20. Write a program to input a number and print the sum of its digit. 21. Write a program to check whether the given number is armstrong or not. 22. Write a program to print all Armstrong numbers upto the given range. 23. Write a program to print the fiboeicci series upto n terms. 24. Write a program to print the sum of n number. Sir please send me answer of this questions.

[@tarunaswini6709]

I saw many video but you clarified me this.

[@meditationmusicvideosposit4620]

1.Write a program to create a 1- D array of n elements and print the sum and average of them in python. 2. write a program to create a 1-D array of n elements and print the total number of elements which are above than average in python. 3. Write a program to create a 1- D array of n elements and print the total number of even and odd elements in python. 4. Write a program to create a 1- D array of n elements and print the largest element exists in the list in python. 5. Write a program to create a 1- D array of n elements and print the smallest element exist in the list in python. 6.write a program to create a 1 -D array of n elements and print the second largest element exists in the list in python. 7.write a program to create a 1-D array of n elements and print the second smallest elements exists in the list in python.

[@zufrankhan7793]

Good job 👍

[@manthangandalwad4251]

Thank you mam for teaching us.. Please upload remaining videos

[@AmulsAcademy]

Pleasure :)

[@oneloveafrica8860]

best video ....I ever seen

[@nageshmhetre6018]

0:38 No video video link in description... Still the link is not needed because you explained very well in this video also... Thank you...

[@AmulsAcademy]

Haha thank you :)

[@darkxxslayer2109]

mam will u also include the program for calculating the height of the bst in this series

[@AmulsAcademy]

I don’t have any plans on that :)

[@محمدعمرمبارز]

God Bless You

[@jayvardhantilgota4136]

Great Explanation Ma'am.

[@AmulsAcademy]

Thank you 😊

[@dheerendragupta6414]

How program will know left subtree is already done. Can't it print left subtree again.

[@abhishekyaduvanshi8403]

hey can you show me how preoder() function work for these value, root =4 , [1,3,2,16,9,10,14,8,7] i think the preorder() function is not giving correct result . please correct me if i am wrong ?

[@johnsonabel5708]

Good madam. Please can you do a tutorial on Big O notation??

[@AmulsAcademy]

Will try 😊

[@KASIDIABHILASH]

Every good explanation!!

[@AmulsAcademy]

Thank you 😊

[@darkxxslayer2109]

thanks.... waiting for the deletion.

[@AmulsAcademy]

Soon :)

[@senthilmuruganr234]

Excellent

[@AmulsAcademy]

Thank you :)

[@chintudasari7011]

Man why didn’t u do a video on hash table and hashmap

[@Darshan-ne3tj]

Thanks a lot 😍

[@adityahpatel]

I don't understand how it will PAUSE... how does it restart?

[@ronakshah5352]

Can you make cv2 toturial

[@AmulsAcademy]

Will try :)

[@ritikathilkar]

in these only key is printing nothing else i have written same code what to do???

[@reshupamidimarri5432]

I created node and bst class seperately and then the traverse method is not worked but the same method if i wrote in node class it worked fine, can you explain why

[@mohitmaurya8734]

share your code once

[@mohitmaurya8734]

as it worked for me perfectly fine

[@vishantjain7061]

Thanku mam ❤️❤️

[@AmulsAcademy]

Pleasure :)

[@watchwithmantri]

Hi Amulya!!

[@AmulsAcademy]

Hello :)

[@watchwithmantri]

@@AmulsAcademy 😍😍😍

[@selvanm2872]

👍👍👍

[@AmulsAcademy]

Thank you :)

[@prachyotbalijapelly1881]

only one word ....just take a bow

[@jithendra5322]

class BST: def __init__(self,key): self.key=key self.rchild=None self.lchild=None def insert(self,data): if self.key is None: self.key=data if self.key>data: if self.lchild: self.lchild.insert(data) else: self.lchild=BST(data) else: if self.rchild: self.rchild.insert(data) else: self.rchild=BST(data) def search(self,data): if self.key==data: print("Node is found") return if data

[@sk-sm5zg]

😘👍👍

[@tranvuong3642]

I feel very bad because it don't have subtitle. I'm from Viet Nam -_-''

[@AmulsAcademy]

Sorry for that...if I get time I will definitely add subtitles 😊

[@promitganguly4591]

hi