6. Binary Trees, Part 1
HTML-код
- Опубликовано: 12 сен 2021
- MIT 6.006 Introduction to Algorithms, Spring 2020
Instructor: Erik Demaine
View the complete course: ocw.mit.edu/6-006S20
RUclips Playlist: • MIT 6.006 Introduction...
This is the first of two lectures on binary trees. This lecture discusses binary tree terminology, tree navigation, and dynamic operations. These are explored in two applications: sets and sequences.
License: Creative Commons BY-NC-SA
More information at ocw.mit.edu/terms
More courses at ocw.mit.edu
Support OCW at ow.ly/a1If50zVRlQ
We encourage constructive comments and discussion on OCW’s RUclips and other social media channels. Personal attacks, hate speech, trolling, and inappropriate comments are not allowed and may be removed. More details at ocw.mit.edu/comments.
He came wearing a root shirt. Legend
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.
this is where peter parker wanted to go for his graduation.
"I'm just a leaf you know"
🌳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`
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!
Emotional damage for node A
the leaf analogy is so funny
Great lecture. I always had confusion about the successor - thanks for the clarification.
I know the comments here get melodramatic but seriously: thanks, it means a lot to have this available
0:00
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!
Thanks MIT for providing great content.
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
Thank you for uploading this lecture!
These classes pay so many dividends. It’s just amazing!
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.
Thank you so much, what a great lecture, respect from Pakistan!
Thanks MIT. Thank you Erik!
At