excellent. I like the ploting part

Best video ❤

any info about making a 2d visualization of a data tree? like printing the drawing on the left as the output of the code

this could be explained much better for better understanding

Thank you so much!

Could you give me the dataset of this project?

Great video, much appreciated.

"no much"? Try "not many". It's pointless to say that space is O(n) ... that's true of any kind of hashing ... or binary trees or linear search or any sort of lookup. And perfect hashing doesn't use a 2-level table ... that's absurd. And what kind of turkey calls himself "The Genius"? No actual geniuses do.

subscribed, thanks for the simple explanation !

what does the D' in the parenthesis mean?

Hey Kindson, Did you upload the Logistic Regression in PyTorch file to GitHub?

wait onenote? ur based

your teaching is so simple thanks

Can we just search the key in the alist dictionary key and return True or False accordingly instead of doing the search again in visited

There some errors in this video. First a Binary Tree is not Binary Search Tree. For some reason the teacher has confused both. Code seems confusing at times.

Thank you, Kindson!

Thank youu !!🙂

i will wait for more videos :) pleese dont stop

Interesting tutorials, all of them! If you care for any constructive feedback the sound needs improving, it's hard to focus on the tutorial because the low frequencies are very high and there's echoing or double voice going on.

Very good course, thanks Sir!

Great to see you back making videos !

thank you very much sir i got conformation form our subscribers thank you very much sir

nice explanation

Nice explanation ❤

Nice explanation ❤❤❤

wouldn't using "np.matmul" or "@" be more clear for what you are trying to teach?

I was solving leetcode basic tree questions, the preorder question passed all tests in one go! but when I tried postorder it didn't -> The correct order is left, right, root

🥰

amazing playlist!

Thank you so much your codes are very clear and helped me a lot

Really intuitive videos, must say. Just a small correction needed for PostTraversal order: it is LEFT-> RIGHT-> ROOT instead of ROOT-> RIGHT-> LEFT. Cheers!

Am lost on how you got p2 and p3 in the table

Where did u get the values in the table. were they given in the question?

here is the code: class Node: def __init__(self, data): self.left = None self.right = None self.data = data def insert(self, data): if self.data is None: self.left = Node(data) else: self.left.insert(data) if data < self.data: if self.left in None: self.left = Node(data) else: self.left.insert(data) elif data > self.data: if self.right in None: self.right = Node(data) else: self.right.insert(data) if __name__ == "__main__": root = None("g") root.insert("c") root.insert("b") root.insert("a") root.insert("e") root.insert("g") root.insert("f") root.insert("i") root.insert("h") root.insert("j") root.insert("k")

Thanks bro

god bless you sir

Why did you use 128 neurons in your first dense layer ??

VERY GOOD EXPLANATION

Why are you dividing by 255

Hi, sorry to comment 3 years after the video, but this seems like the method you explained doesn't actually get you the shortest path because it doesn't look ahead at future costs/distances. In your example: You said A C B D A is the shortest path, with a total of 14 (1+1+5+7) But there's another path, A C D B A that has a total of 11 (1+2+5+3) because it avoids the highest cost/distance path. This simplified solution is a bit misleading.

not clear

very helpful, thanks!

28 x 28 is not 255....

Sir, would you please mind lowering the background audio its kinda hard to concentrate .Thankyou

Thank you very much for your video it has really helped me understand DFS, especially with how it is supposed to work with the stack.

Ive been on a wild goose chase trying to figure out how to write the equation, this was such a simple and helpful explanation. Keep up the good work!

how to do same for string columns ?

thanks for making this topic clearer.

Simple & easy to understand. Thank you!!

????