正在加载视频...

视频加载失败

加载此视频时出现问题。这可能是由于临时网络问题，或视频可能不可用。

MIT 6.006 Introduction to Algorithms. nodes, pointers, and parent relationships in binary trees.

tetsuo

240,997 subscribers

49,706 次观看 • 5 个月前 •via X (Twitter)

教育科学技术

Anya Rossi• Live Now

Private livecam show

11 条评论

Andrea Hatfield🩷 的头像

Andrea Hatfield🩷5 个月前

@AmX_ZaxTr Binary trees in MIT 6.006: where nodes, pointers, and parent relationships are still the DNA of efficient computing — and the silent foundation of everything AI does today. Timeless class. 🌳

Angel 的头像

Angel5 个月前

Remember when people had to do those to land any software job?. Reversing binary trees and responding to trick questions for a FAANG job

ZaxtR 的头像

ZaxtR5 个月前

Where did everyone go? 🤨🤷‍♂️

David🚀 的头像

David🚀5 个月前

Truth, goodness, and beauty

jansel 的头像

jansel5 个月前

BM3RYbkZZfC7KPPGxdhC681N4a41fZmrDp2vLzggpump

Mkaey🔺 的头像

Mkaey🔺5 个月前

Binary trees looked confusing at first, but once the parent and pointer relationships start clicking, everything makes way more sense

Mario 的头像

Mario5 个月前

I remember good at university, C++ by Borland. Exciting.

i need YHWH 的头像

i need YHWH5 个月前

Alpha

desiVoidStar 的头像

desiVoidStar5 个月前

I will stick my pointer in mighty b00b anyday 😂

Navi 的头像

Navi5 个月前

💗

Caustic Dave 🇺🇸 的头像

Caustic Dave 🇺🇸5 个月前

Brings back memories…

相关视频

Solve Super Mario Brothers by Dynamic Programming. MIT 6.006 Introduction to Algorithms, Fall 2011

Solve Super Mario Brothers by Dynamic Programming. MIT 6.006 Introduction to Algorithms, Fall 2011

tetsuo

11,202 次观看 • 5 个月前

Super Mario Brothers Solved by Dynamic Programming. MIT 6.006 Introduction to Algorithms, Fall 2011

Super Mario Brothers Solved by Dynamic Programming. MIT 6.006 Introduction to Algorithms, Fall 2011

tetsuo

50,308 次观看 • 5 个月前

No algorithm can decide whether an arbitrary program will halt. This is why every runtime ships with timeouts. Alan Turing proved this before anyone had a computer to run it on. MIT 6.006 Introduction to Algorithms, Fall 2011 Instructor: Erik Demaine

No algorithm can decide whether an arbitrary program will halt. This is why every runtime ships with timeouts. Alan Turing proved this before anyone had a computer to run it on. MIT 6.006 Introduction to Algorithms, Fall 2011 Instructor: Erik Demaine

tetsuo

77,446 次观看 • 5 个月前

You can't engineer luck. Cleanest phrasing of P vs NP I've heard. NP is the magical computer that always tells you which path to take. P is what current silicon can do. Tetris is NP-complete. Chess is EXP-complete. MIT 6.006 Introduction to Algorithms, Fall 2011.

You can't engineer luck. Cleanest phrasing of P vs NP I've heard. NP is the magical computer that always tells you which path to take. P is what current silicon can do. Tetris is NP-complete. Chess is EXP-complete. MIT 6.006 Introduction to Algorithms, Fall 2011.

tetsuo

648,562 次观看 • 5 个月前

Introduction to Garbage Collection & two simple algorithms

Introduction to Garbage Collection & two simple algorithms

teej dv 🔭

51,471 次观看 • 2 年前

1. Introduction to Computer Science and Programming Using Python. Topics: • A Notion of computation • Python programming language • Some simple algorithms • Informal introduction to algorithmic complexity • Data Structures and more 🔗

1. Introduction to Computer Science and Programming Using Python. Topics: • A Notion of computation • Python programming language • Some simple algorithms • Informal introduction to algorithmic complexity • Data Structures and more 🔗

Shruti

732,076 次观看 • 2 年前

MIT's "Introduction to Algorithms" Lecture Notes: Lecture Videos: (audio generated by NotebookLM)

MIT's "Introduction to Algorithms" Lecture Notes: Lecture Videos: (audio generated by NotebookLM)

Math Cafe

31,536 次观看 • 1 年前

Holy shit… someone just made DSA finally click. Not static notes Not boring pseudocode Not guessing what happens in memory Real data structures — animating step-by-step — visually. It’s called Data Structure Visualizations and it lets you watch algorithms run in real time. Here’s why this is different: Instead of dumping theory, it shows execution live • nodes getting inserted • trees rotating • pointers moving • queues filling • stacks popping • graphs traversing • heaps rebalancing You literally see algorithms think. Everything is interactive: • Binary Search Trees • AVL Trees (with rotations) • Red-Black Trees • Heaps & Priority Queues • Graph BFS / DFS • Dijkstra & MST • Hash Tables • Tries • Sorting (Quick, Merge, Heap…) • Dynamic Programming No black box. Just input → steps → result Watch in real time: • AVL rotations balancing themselves • BFS exploring layer by layer • DFS diving deep then backtracking • Dijkstra relaxing edges step-by-step • Quick sort partition visually • Heap forming after each insert • Hash collisions resolving live This solves the biggest DSA problem: Most resources teach code → memorize → hope it works This shows input → execution → visualization → understanding Which means you finally understand: • why AVL rotates • how heap property maintains • how BFS differs from DFS • how Dijkstra actually updates distances • what happens during rehashing • how quicksort partitions • how trees rebalance Even better: You control everything Change values Insert nodes Run step-by-step Pause execution Replay algorithms Learning DSA becomes interactive Not passive Not confusing Not theoretical Just… visible. Perfect for: • DSA beginners • interview prep • visual learners • CS students • LeetCode prep • teaching algorithms • debugging understanding This is the kind of resource that makes trees, graphs, and sorting finally click. Link: We’re moving from reading DSA → watching DSA execute And once you can see algorithms… you stop memorizing and start understanding.

Holy shit… someone just made DSA finally click. Not static notes Not boring pseudocode Not guessing what happens in memory Real data structures — animating step-by-step — visually. It’s called Data Structure Visualizations and it lets you watch algorithms run in real time. Here’s why this is different: Instead of dumping theory, it shows execution live • nodes getting inserted • trees rotating • pointers moving • queues filling • stacks popping • graphs traversing • heaps rebalancing You literally see algorithms think. Everything is interactive: • Binary Search Trees • AVL Trees (with rotations) • Red-Black Trees • Heaps & Priority Queues • Graph BFS / DFS • Dijkstra & MST • Hash Tables • Tries • Sorting (Quick, Merge, Heap…) • Dynamic Programming No black box. Just input → steps → result Watch in real time: • AVL rotations balancing themselves • BFS exploring layer by layer • DFS diving deep then backtracking • Dijkstra relaxing edges step-by-step • Quick sort partition visually • Heap forming after each insert • Hash collisions resolving live This solves the biggest DSA problem: Most resources teach code → memorize → hope it works This shows input → execution → visualization → understanding Which means you finally understand: • why AVL rotates • how heap property maintains • how BFS differs from DFS • how Dijkstra actually updates distances • what happens during rehashing • how quicksort partitions • how trees rebalance Even better: You control everything Change values Insert nodes Run step-by-step Pause execution Replay algorithms Learning DSA becomes interactive Not passive Not confusing Not theoretical Just… visible. Perfect for: • DSA beginners • interview prep • visual learners • CS students • LeetCode prep • teaching algorithms • debugging understanding This is the kind of resource that makes trees, graphs, and sorting finally click. Link: We’re moving from reading DSA → watching DSA execute And once you can see algorithms… you stop memorizing and start understanding.

Suryansh Tiwari

14,627 次观看 • 7 个月前

Volumetric stylised trees using raymarching, Blender 5.0, repeat node, Eevee. 40k Trees. #blender #b3d #shader #nodes #eevee

Volumetric stylised trees using raymarching, Blender 5.0, repeat node, Eevee. 40k Trees. #blender #b3d #shader #nodes #eevee

Shahzod Boyhonov

117,416 次观看 • 1 年前

An MIT introduction to computer science & Python programming:

An MIT introduction to computer science & Python programming:

MIT CSAIL

182,550 次观看 • 1 年前

The van Emde Boas tree answers successor and predecessor queries in log log u time. MIT 6.046J Design and Analysis of Algorithms

The van Emde Boas tree answers successor and predecessor queries in log log u time. MIT 6.046J Design and Analysis of Algorithms

tetsuo

18,652 次观看 • 5 个月前

'Introduction to Poker Theory' From Poker Theory & Analytics (MIT OpenCourseWare):

'Introduction to Poker Theory' From Poker Theory & Analytics (MIT OpenCourseWare):

Alex Bilzerian

58,789 次观看 • 2 年前

In graph theory, there are algorithms that find the shortest path between two nodes. I made one with pure CSS (including the graph drawing). Drag the nodes, and the shortest path will update in real-time! A demo powered by all the modern CSS features🤩

In graph theory, there are algorithms that find the shortest path between two nodes. I made one with pure CSS (including the graph drawing). Drag the nodes, and the shortest path will update in real-time! A demo powered by all the modern CSS features🤩

CSS by T. Afif

1,202,757 次观看 • 8 个月前

$Our third 80 Level course, Introduction to Geometry Nodes in Blender, is now live. Led by CGMatter, this 5+ hour course breaks down the fundamentals of proceduralism – from fractals and fields to animation without keyframes. Enroll:$

Our third 80 Level course, Introduction to Geometry Nodes in Blender, is now live. Led by CGMatter, this 5+ hour course breaks down the fundamentals of proceduralism – from fractals and fields to animation without keyframes. Enroll:

80 LEVEL

43,076 次观看 • 1 年前

After 7 failed relationships, 2 cancelled engagements, and 1 cancelled introduction, man finally finds a wife.

After 7 failed relationships, 2 cancelled engagements, and 1 cancelled introduction, man finally finds a wife.

YabaLeftOnline

24,264 次观看 • 11 个月前

25 algorithms every programmer should know: Let's start with my top favorite 10. If nothing else, you should read about these algorithms and have a good idea of how they work: 1. Linear search to find an element in a list 2. Binary search to find an element on a sorted list 3. Bubble sort to sort a list 4. Merge sort will also sort lists 5. Quicksort to sort the list and do it fast 6. Dijkstra to find the shortest path in a graph 7. Breadth-first Search (BFS) for trees or graphs 8. Depth-first search (DFS) for trees or graphs 9. Huffman for doing data compression 10. Anything related to dynamic programming Learning about algorithms is like getting tattoos: you never have enough. Here are another 5 algorithms that will help you go beyond the basics: 11. Kruskal for the finding minimum spanning tree 12. Floyd Warshall, shortest paths in a graph 13. Union Find to detect cycles in a graph 14. Bellman-Ford, shortest path in a graph 15. Lee for finding the shortest path in a maze If you are serious about this topic, I recommend learning about algorithms' space and time complexity. People usually refer to this topic as "Big O" notation. You should build a good intuition about the performance of different algorithms and learn how to evaluate them. Machine Learning will rule the next 50 years, so the next 10 algorithms you can't ignore are the following: 16. Linear Regression 17. Logistic Regression 18. Decision Trees 19. Bayes' theorem 20. k-Nearest Neighbors (kNN) 21. Every algorithm related to neural networks 22. K-means 23. Random forest 24. Gradient boosting algorithms 25. Any dimensionality reduction algorithm (PCA, for instance) There are many more mind-blowing algorithms! I haven't found a better way to understand how computers work from a first-principles point of view than reading about different algorithms. Take a look at the attached video.

25 algorithms every programmer should know: Let's start with my top favorite 10. If nothing else, you should read about these algorithms and have a good idea of how they work: 1. Linear search to find an element in a list 2. Binary search to find an element on a sorted list 3. Bubble sort to sort a list 4. Merge sort will also sort lists 5. Quicksort to sort the list and do it fast 6. Dijkstra to find the shortest path in a graph 7. Breadth-first Search (BFS) for trees or graphs 8. Depth-first search (DFS) for trees or graphs 9. Huffman for doing data compression 10. Anything related to dynamic programming Learning about algorithms is like getting tattoos: you never have enough. Here are another 5 algorithms that will help you go beyond the basics: 11. Kruskal for the finding minimum spanning tree 12. Floyd Warshall, shortest paths in a graph 13. Union Find to detect cycles in a graph 14. Bellman-Ford, shortest path in a graph 15. Lee for finding the shortest path in a maze If you are serious about this topic, I recommend learning about algorithms' space and time complexity. People usually refer to this topic as "Big O" notation. You should build a good intuition about the performance of different algorithms and learn how to evaluate them. Machine Learning will rule the next 50 years, so the next 10 algorithms you can't ignore are the following: 16. Linear Regression 17. Logistic Regression 18. Decision Trees 19. Bayes' theorem 20. k-Nearest Neighbors (kNN) 21. Every algorithm related to neural networks 22. K-means 23. Random forest 24. Gradient boosting algorithms 25. Any dimensionality reduction algorithm (PCA, for instance) There are many more mind-blowing algorithms! I haven't found a better way to understand how computers work from a first-principles point of view than reading about different algorithms. Take a look at the attached video.

Santiago

274,092 次观看 • 2 年前

1. Introduction to Computer Science and Programming Using Python. What you'll learn: • Skip What you'll learn • A Notion of computation • The Python programming language • Some simple algorithms • Testing and debugging • Data structures 🔗

1. Introduction to Computer Science and Programming Using Python. What you'll learn: • Skip What you'll learn • A Notion of computation • The Python programming language • Some simple algorithms • Testing and debugging • Data structures 🔗

Alamin

75,165 次观看 • 3 年前

🦀 Crabwalk for OpenClaw🦞 v1.0.5 + v1.0.6 Release 🦀 Subagent Support and Follow Mode 🤖 Subagent Support — Track your agent as they spawn subagents in real-time. Hierarchical layout shows parent→child relationships, collapsible groups in the sidebar, and exec processes rendered as nodes with status-colored edges. 🎯 Follow Mode — Auto-pans the graph to track incoming nodes as your agent works. No more manually scrolling to find the action. Set and forget. Also: - Layout direction toggle (horizontal/vertical) - Async layout calc for large graphs - Spawn position caching to prevent jitter - Working Docker builds 🦀 A word from our sponsor at the end of the video.

🦀 Crabwalk for OpenClaw🦞 v1.0.5 + v1.0.6 Release 🦀 Subagent Support and Follow Mode 🤖 Subagent Support — Track your agent as they spawn subagents in real-time. Hierarchical layout shows parent→child relationships, collapsible groups in the sidebar, and exec processes rendered as nodes with status-colored edges. 🎯 Follow Mode — Auto-pans the graph to track incoming nodes as your agent works. No more manually scrolling to find the action. Set and forget. Also: - Layout direction toggle (horizontal/vertical) - Async layout calc for large graphs - Spawn position caching to prevent jitter - Working Docker builds 🦀 A word from our sponsor at the end of the video.

Luciano Castillo

59,009 次观看 • 9 个月前