Why self.head= tmp.prev I think it should be self.head= tmp Or current.prev So if current.prev us not null self.head = current.prev once it comes out of the loop

Then what about link bw them in reverse bcs previous head also will have current.next memory location just like reversed linked list and u dint use while loop to do it

I'm having a lot of trouble trying to stop the program running mid way with ctrl + c (on windows) it just seems to keep spawning in processes and i cant stop it

❤

Very didatic, clear and essential; You are at least 1000 x better than my data structutre teachers all added together. Keep up the excelent work

Not a hard problem at all in just understanding it and the solution is very simple as well. However I must admit this is the type of problem I feel like you wouldn’t understand how to solve unless you have seen it before, failed, then looked at the solution. Maybe I’m just not good enough I’ll accept that. Or I don’t understand trees as much as I thought I do. I just find it hard to believe most would know how to solve it without first failing. The trick for the max never crossed my mind. The way I would have solved it at first was to long and I knew wasn’t right. I thought about always spliting up right and left pointers of the sub tree and kept incrementing the height but knew instantly that wouldn’t work and become to complicated. Great video appreciate you breaking it down

More than amazing explanation

Funny, I came to this video because Copilot suggested it as a new line after "...video" word

SOU BRASILEIRO , ADOREI SEU VIDEO , E BEM O QUE EU PRECISO NO MEU CURSO , OBRIDADO

Plz send link for the video explain init, print, all preactual coding for this target or that of swap nodes.as I can not call functions Many thanks

WOW you explain the whole topic in such detail in such less time !! thanks alot ^^

you are a legend! thanks for this tutorial.

Excellent tutorial!! Great explanation! You rock

Thank you very much. Very clear lecture and explaination <3

Hello Mr Lucid, your lecture is very great, but there is a typo in function of postorder_print() traversal = self.postorder_print(..) instead of inorder_print, which leads to incorrect result the result should be 4-5-2-6-7-3-1 ( I hope I am right after learn your teaching ^^!)

The height and depth concept..I think the depth at the root node is depth 0 and increases by 1 as you go down the tree. And this is the opposite for the heights. But looks like you started counting at 1 instead of 0.

it will fail for s1="ababa" and s2="bbaaa"

Thank you so much , this saved me you deserve more than just a like and subscribe

This has been so helpful, dude. Thank you❤❤❤

You have helped me a lot. Thank you for the tutorial

its not a correct solution when you are replacing you should use str_2=str_2.replace(c,"",1) then this will work but the time complexity will increase @lucidProgramming

what if we have 2 closest numbers to the target, like both are at the same distance from the target, how to get both of them?

good video and explanation

Thank you very much

why does the enqeueue method insert an element at first index of the list? isn't a queue FIFO?

Shouldn't it be self.preorder_print(self.root, " ") in the helper function of the BinaryTree? There is no tree variable in the class and the only way the code is still running correctly is because "tree" happens to be defined outside of class, no?

Under what condition do you recommend using Pool as opposed to Process?

Thank you for this video

Thank you so much for creating these data structure videos. I finally understand how to create python class and how to code linked list. Another idea for swapping two nodes is to create two empty linkedlist in the function and point those linkedlists to the nodes that to be swapped. And then just swap the data. This way we do not need to keep track of where the .next part goes and we only need to iterate through the original linkedlist once. The code looks like this: def ll_swap(self, data1, data2): if data1==data2: print('the two values are the same. Nothing to swap') return if self.ll_length() is None or self.ll_length()<2: print('not enough nodes to swap') return ll1=LinkedList() ll2=LinkedList() curr_node=self.head while curr_node: if curr_node.data==data1: ll1.head=curr_node if curr_node.data==data2: ll2.head=curr_node curr_node=curr_node.next if ll1.head and ll2.head: #swap the data of the two nodes that are marked by ll1.head and ll2.head ll1.head.data, ll2.head.data=ll2.head.data, ll1.head.data return print('the data to be swaped is not in the linked list') return

Keep going

this man never spend a day in his life as a developer...so much repetitive code

3:59 says join makes sure all processes started have SUCCESSFULLY completed. Kind of misleading. There are many ways to complete, like throwing exception is also considered complete. Key point when join is about child process/thread ending it's execution, which may or may not mean running to the last line in the script.

12:27 says all adds are completed before all subs. That is not true. Add a print after each function like print(f"{total.value} after add/sub") to see that it's actually interweaved and fluctuating around 490-510, but eventually ending on 500

I have looked at A LOT of python parallel videos and this is the first one that worked! I also added a print line to the serial function to confirm the output; they were consistent. Furthermore, it worked well and can be adapted easily for more advanced applications. Thank you!

600th like :)

for future add case sensitivity

Extremely thankful to you sir.

It seems multiprocessing doesn't directly work with Jupyterlab (or IPython, not sure), one workaround is to have the worker function in a separate .py file and imported. Also, I am not sure about the high level concurrent module, but I think it's important to let new multiprocessing learners know about this at the beginning, thanks.

thanks good tutorial; tho you have a bug which is python's fault to be honest. It has allowed you to do this: return self.preorder_print(tree.root, "") ; it had to be self.root

Man you are a genius OMG

nicely explained thanks for the clear explanation.

Very nice explanation sir

thanks so much mate, been tryna wrap my head around this all day.. glad i got to watch your video

So what happens when you have multiple cards from the same place?

There's a bug in your code. you need to return here def append(self, data): if not self.head: self.head = Node(data) self.head.next = self.head return otherwise, it'll be stuck in infinite loop

Perfect

Unfortunately, pandoc can't scale images from screenshots correctly. For that reason images' titles are going out of the lower slide bound. Any recommendations?

Your explanation was really amazing, you should come back make more of this awesome videos. I was confused all day about how to define the bst functions and magically youtube suggested your channel.

@lucidProgramming Python 3.10/centos7 When I paste the code from Part 4 into my py file and run it, i get an error putrequest raise InvalidURL(f"URL can't contain control characters. {url!r} http.client.InvalidURL: URL can't contain control characters. '/youtube/v3/videos?part=snippet&id=f3FyWUG1w_M &key=' (found at least ' ')

Sir great tutorial ever... I don't watch such a great tutorial before that.. Sir please continue advance tutorials if possible..