ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

124 results

Adam Gaweda, Dr. Sensei
Worked Example of a 2-3 (a,b) Tree Pt.1 - Insertion and Fusion Removal

There is an error on step 5, I fix the error later in the video - luckily, it doesn't break everything, it just needed a minor fix.

11:48
Worked Example of a 2-3 (a,b) Tree Pt.1 - Insertion and Fusion Removal

12,244 views

8 years ago

Adam Gaweda, Dr. Sensei
Splay Tree - Remove Root with 1 child

- [Narrator] So now let's say for our sake I came across this tree and I made a remove 25. So we're kind of in an interesting position ...

1:36
Splay Tree - Remove Root with 1 child

1,539 views

8 years ago

Adam Gaweda, Dr. Sensei
Splay Tree - Remove Leaf Node

This would go from being ZYX... with the necessary trees everywhere, to XYZ. So in our example here of 35, 50, 75, again we ...

2:00
Splay Tree - Remove Leaf Node

1,502 views

8 years ago

Adam Gaweda, Dr. Sensei
AVL Trees

- [Narrator] So let's take for example creating a traditional, normal binary search tree with the insertions as listed. So, since I say ...

5:44
AVL Trees

2,421 views

8 years ago

Adam Gaweda, Dr. Sensei
2-3 (a,b) Trees - Lookup

This is where we would actually follow the same principles that we saw inside of a traditional Binary Search Tree. I look at my first ...

2:51
2-3 (a,b) Trees - Lookup

581 views

8 years ago

Adam Gaweda, Dr. Sensei
Splay Tree - Remove Node with Children Part 2 of 2

- [Narrator] So what if given this tree here, I gave the remove operation of remove 50? Now you remember in the previous video, ...

2:14
Splay Tree - Remove Node with Children Part 2 of 2

4,604 views

8 years ago

Adam Gaweda, Dr. Sensei
Splay Tree - Removing a Nonexistent Node
4:37
Splay Tree - Removing a Nonexistent Node

1,482 views

8 years ago

Adam Gaweda, Dr. Sensei
2-3 (a,b) Trees - Insert

- [Instructor] So we do have a limitation when it comes to the binary search tree. Let's say for example I came in and said ...

10:57
2-3 (a,b) Trees - Insert

13,362 views

8 years ago

MOOC de l'IMT
10. Min-heaps 🌐 Advanced Algorithmics and Graph Theory with Python

Strengthen your skills in algorithmics and graph theory, and gain experience in programming in Python along the way. To follow ...

3:53
10. Min-heaps 🌐 Advanced Algorithmics and Graph Theory with Python

2,732 views

7 years ago

MOOC de l'IMT
6. Graph Traversal 🌐 MOOC Advanced Algorithmics & Graph Theory with Python

Strengthen your skills in algorithmics and graph theory, and gain experience in programming in Python along the way. To follow ...

8:09
6. Graph Traversal 🌐 MOOC Advanced Algorithmics & Graph Theory with Python

3,739 views

7 years ago

MOOC de l'IMT
1. Introduction 🌐 MOOC Advanced Algorithmics & Graph Theory with Python

Strengthen your skills in algorithmics and graph theory, and gain experience in programming in Python along the way. To follow ...

3:10
1. Introduction 🌐 MOOC Advanced Algorithmics & Graph Theory with Python

8,346 views

7 years ago

Tyler Caraza-Harter
CS 320 Sep 30 (Part 2) - Tree Recursion

hello in this video i want to talk about how we can think about recursive method calls for binary trees and we had an initial ...

14:27
CS 320 Sep 30 (Part 2) - Tree Recursion

208 views

5 years ago

DrKode
Leetcode 100 Same Tree (Animation)

website: https://drkode.org Time Stamp 00:00 statement 00:14 Basics 00:38 Storyboard 01:52 drkode.org 01:59 Code explanation ...

3:08
Leetcode 100 Same Tree (Animation)

66 views

10 months ago

Tyler Caraza-Harter
CS 320 Oct 5 (Part 1) - BST Review

... do i have value x without checking every single node so binary search tree the b stands for binary which means each node has ...

10:52
CS 320 Oct 5 (Part 1) - BST Review

211 views

5 years ago

Confreaks
RubyConf 2016 - Computer Science: The Good Parts by Jeffrey Cohen

Maybe you've seen jargon like "Big O Notation," "binary trees", "graph theory", "map-reduce", or the "Turing test", but have been ...

30:25
RubyConf 2016 - Computer Science: The Good Parts by Jeffrey Cohen

1,068 views

9 years ago

Tyler Caraza-Harter
CS 320 Oct 2 (Part 2) - BST Search

hello last time we were working on uh building this binary tree and it might have the node class and i kind of copied that and just ...

21:00
CS 320 Oct 2 (Part 2) - BST Search

209 views

5 years ago

NPTEL IIT Guwahati
Lec 42: Decision tree classifier

Data Analysis for Biologists Playlist Link: https://www.youtube.com/playlist?list=PLwdnzlV3ogoXmoCXczKiu6WGW0r05Zw02 Prof.

29:04
Lec 42: Decision tree classifier

2,721 views

3 years ago

Adam Gaweda, Dr. Sensei
Splay Trees - Zig-Zig

- [Narrator] So now what if I were to take that newly revised tree and give it an insert 75? Our normal binary search tree rules apply ...

5:47
Splay Trees - Zig-Zig

8,591 views

8 years ago

Orange Data Mining
Classification Trees

In this video, we explore classification trees using the Iris dataset in Orange. We use the Select Columns widget to examine the ...

5:19
Classification Trees

15,936 views

2 years ago

Orange Data Mining
Forward Pruning of Trees

In this video, we dive deeper into classification trees using the Iris dataset in Orange. We examine the concept of "forward pruning" ...

3:45
Forward Pruning of Trees

5,317 views

2 years ago

Mark Duchaineau
The ROAM Algorithm at 25

Talk on the ROAM Algorithm for its 25th anniversary, accepting the IEEE SciVis Test of Time Award.

3:53
The ROAM Algorithm at 25

338 views

3 years ago

Adam Gaweda, Dr. Sensei
Splay Tree - Remove Node with Children Part 1 of 2

Since we're in a binary tree I would first need to find that three, so I would traverse downward until I've found it. And given that's an ...

4:35
Splay Tree - Remove Node with Children Part 1 of 2

6,089 views

8 years ago

Rafiq Bouhsen
15.Cryptography: Merkle Tree, Validation of Data

... Tree: A special type of data storage structure based on hash functions is called a Merkle tree: It is structured as a binary tree; the ...

1:57
15.Cryptography: Merkle Tree, Validation of Data

142 views

4 years ago

Florian Kurpicz
Practical Performance of Space Efficient Data Structures for Longest Common Extensions (ESA'20)

This is the recording of my presentation of the paper "Practical Performance of Space Efficient Data Structures for Longest ...

19:31
Practical Performance of Space Efficient Data Structures for Longest Common Extensions (ESA'20)

168 views

5 years ago

Tyler Caraza-Harter
CS 320 Oct 2 (Part 3) - BST Dictionary

so in the last video we built this node class that we can use for a binary search tree and we saw that we can very efficiently run this ...

9:46
CS 320 Oct 2 (Part 3) - BST Dictionary

607 views

5 years ago