@wisdomkhan
Thank you very much MIT. Please do not ever stop this life changing work. Those who dream of studying in MIT can fulfil it here.
@knowsomething-b8d
He came wearing a root shirt. Legend
@biswanathsingh1991
Very interesting and educational course; after searching all internet resources, this is the only excellent, free, Python-based course on algorithms. It taught me a lot of things
@linonator
These classes pay so many dividends. It’s just amazing!
@sushanthreddy5513
At 29:17, I think it should be "return node.parent" instead of "return node" as node.parent would then be the first parent with a left-child while moving up the tree.
@nate716
What strikes me is that these lectures are the exact same as the computer science lectures we get at my very low ranked public university. But the difference is that the students in the room have better GPA and accolades than most students in the country. We all learn the exact same things, but the difference is what we do with this knowledge. That’s what makes MIT different. Thank you for posting this for free. :))
@th2315
Very engaging and informative class, I look through all the online sources, this is the only high-quality algorithm course that is free and python-based. I learned a lot from it! Loved it!
@sangamsamdarshi4634
There’s no parent pointer in tree given generally , as tree is generally defined with left and right pointers but this lecture provides the idea of how to think like a problem solver
@prashantsharma312
Great lecture. I always had confusion about the successor - thanks for the clarification.
@pif5023
Thank you for sharing this lesson!! As a self thought professional this really gave me ahas moment! For better or worse I was hired before I could dive deep into algos and these lessons are gold!
@ernesto8738
I know the comments here get melodramatic but seriously: thanks, it means a lot to have this available
@mikhailkilianovski8024
🌳Could you provide a justification for why we need to 🔁swap 🔁values while doing deletion instead of just overwriting the value of a current node `A` with a value of node `B` :oops: ? We are going to delete🚮 `B` anyway, so why bother writing something there?
@wyqtor
Older Erik Demaine is an S-tier teacher.
@suindude8149
The depth and the breadth first search would be the representation criteria for the data stored inside the memory thus the Information science has got a great evolution. The most efficient search criteria may be having the best case in case of a particular structure namely BFS would be a faster in time complexity than DFS. BFS could be implemented by using the any directional criteria using Stack as the structural unit.
@ahmedyasser638
why would i every need to insert before or after in BTS 36:00 it supposed to be sorted automatically without me doing any thing
@aghahasaan
Thank you so much, what a great lecture, respect from Pakistan!
@originalgamer4962
why did we not swapped a with d at (42.11-video) , that would be the leaf node and we could immediately remove the a
@apuravmahajan283
29:13, should it be return node.parent? i am confused anybody explain please
@krishviz485
Can someone clarify "why insert_before and insert_after is required in BST ADT when insert operation takes care of inserting where it belongs to?"
@ParthPatel-vj2zv