you prolly dont care at all but does someone know of a trick to log back into an Instagram account? I was stupid forgot my login password. I appreciate any tricks you can offer me!
This really helped me a lot, thankyou for creating such great content :) It'd also be great if you explain multiple problems like the ones on leetcode, codeforces, etc
Great explanation. By the way, I am unable to add some of your videos, including this one, into my playlist. Is there a way you can enable that feature for your videos? This makes it easier to find them in the future. Thanks!
class node: def __init__(self,data): self.data=data self.left=None self.right=None class bst: def __init__(self): self.head=None def search(self,x): if(self.head==None): print("trees are empty") else: n=self.head while(n is not None): if(n.data==x): break if(x>n.data): n=n.right else: n=n.left if(n is None): print("no such node with given data") else: print('yes ,this data is in Tree') def formation(self,*a): for i in range(len(a)): x=a[i] if(self.head==None): self.head=node(x) else: n=self.head while(True): if(n.data==x): print("duplicaion is not alloed") break elif(x>n.data): if(n.right==None): n.right=node(x) break else: n=n.right
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 return if self.key==data: return 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) root=BST(10) list1=[20,4,30,4] for i in list1: root.insert(i)
almost every tutorials are good, but in this tutorial, you are confused that to move on which point first for explaining! My just suggestions to uh is... just hold a single condition and explain that properly instead of jumping from 1 condition to other!
Thank you very much, I have been trying to visualise this for too long but didn't got any channel who explained it with so much efficiency
your channel is so underrated. The way you are explaining things are very good.
Thank you madam,
you not only teach us, but also gives confidence
Glad to hear that 😊❤️
Best explanation for data structure algorithms on youtube. Thank You so much!
My first comment very nice video vice nice ma'am make more videos we are watiing your videos think you.
Thank you :)
@@AmulsAcademy Welcome
You know the chemistry of computer science and how to explain it well!
The underrated UA-cam/ Mentor❤️❤️
Thank you 😊
you prolly dont care at all but does someone know of a trick to log back into an Instagram account?
I was stupid forgot my login password. I appreciate any tricks you can offer me!
Amazing Explanation! Please keep making many such videos.
Thank you 😊
Explained very well...
Now I think data structure using python is not that difficult...
Thank you...
Thank you so much :)
Just curious to know fabulous person behind such incredible content.....
mam it is a great explanation....Thank you so much mam......
This really helped me a lot, thankyou for creating such great content :)
It'd also be great if you explain multiple problems like the ones on leetcode, codeforces, etc
Very Clear Explanation.....I never seen
Best explanation , Thanks a lot
Pleasure 😊
Awesome video, keep up the incredible work! :)
Thank you :)
Thanks alot mam
Respect from Nepal
one of the easy way to get into the ooops concept using the binary treeeeeeeeeeeeeeeeeeeeeeeeeeeeeeee
Yessss❤❤❤❤❤
Thanks Amulya mam🙏
Pleasure :)
Please make videos on DSA. one of the best teacher
Great explanation. By the way, I am unable to add some of your videos, including this one, into my playlist. Is there a way you can enable that feature for your videos? This makes it easier to find them in the future. Thanks!
superb. Thanks for clear explanation.
Hello mam, Adding the self.leftNode.insert(data) shows Nonetype object has no attribute insert, error!!!
mam pls make a video of insertion in bst in which the bst class is separated with new node class like we did it in linked list.
I will try :)
Excellent 🤩
Thank you 😊
thank you amulya
Pleasure :)
you are the best
very good explanation thank u
Pleasure :)
why not take another parameter which is pointing towards its parent node??
It was Great ..
Thank you 😊
can you make a video on implementation of min and max heap in python by writing program
Please do videos daily on DSA with python
I will try :)
thanks madam well explained
can you plz attach the code in the video description? That will be very helpful for us.
Noted 😊
Thank you so much
Thank you so much 😊
Pleasure :)
I have some doutes don't they have links
How to print that binary tree??
Where is the next video ma'am? I need the video asap.. pls upload it
Ma'am pls upload the next video
Sorry for the delay :)
@@AmulsAcademy no problem ma'am.. thankyou so much for your efforts🙏
explain printing tree function also mam
Thanks mam
Pleasure :)
nice
If self. Key is none
self. Key==BST(data)
return
We need to use BST right, in 1st step
please make graph also
Will upload the video soon 😊
ty dear
class node:
def __init__(self,data):
self.data=data
self.left=None
self.right=None
class bst:
def __init__(self):
self.head=None
def search(self,x):
if(self.head==None):
print("trees are empty")
else:
n=self.head
while(n is not None):
if(n.data==x):
break
if(x>n.data):
n=n.right
else:
n=n.left
if(n is None):
print("no such node with given data")
else:
print('yes ,this data is in Tree')
def formation(self,*a):
for i in range(len(a)):
x=a[i]
if(self.head==None):
self.head=node(x)
else:
n=self.head
while(True):
if(n.data==x):
print("duplicaion is not alloed")
break
elif(x>n.data):
if(n.right==None):
n.right=node(x)
break
else:
n=n.right
else:
if(n.left==None):
n.left=node(x)
break
else:
n=n.left
def deleation(self,x):
bst1=bst()
Can we do it like that with no confusion.
If it is working then why not 😊
Please share the code
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
return
if self.key==data:
return
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)
root=BST(10)
list1=[20,4,30,4]
for i in list1:
root.insert(i)
Your voice is like of a teen, are you a college student or Teacher?
Tutorials are real helpful btw.
Thank you :)
i bet she is teacher !
Mam source code plz
Any one Please paste the code here
almost every tutorials are good, but in this tutorial, you are confused that to move on which point first for explaining! My just suggestions to uh is... just hold a single condition and explain that properly instead of jumping from 1 condition to other!
worst explanation