ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

8 results

Vu Hung Nguyen (Hưng)
Binary Search Tree: Visualising Search, Insert, and O(log N) Traversal

A Binary Search Tree (BST) is a fundamental hierarchical data structure where every node maintains the BST invariant: all keys in ...

0:39
Binary Search Tree: Visualising Search, Insert, and O(log N) Traversal

3 views

8d ago

Vu Hung Nguyen (Hưng)
Binary Heap: Visualising the Max Heap Property and ShiftUp

A Binary Heap is a complete binary tree that maintains the Heap property, serving as the foundational engine for Priority Queues ...

0:23
Binary Heap: Visualising the Max Heap Property and ShiftUp

7 views

8d ago

Vu Hung Nguyen (Hưng)
Traveling Salesperson Problem: Visualising 2-Opt and Held-Karp Dynamic Programming

The Traveling Salesperson Problem (TSP) is one of the most famous and foundational challenges in computer science and ...

0:28
Traveling Salesperson Problem: Visualising 2-Opt and Held-Karp Dynamic Programming

22 views

8d ago

Partners DSA
Delete Leaves With a Given Value - Post Order Traversal

Given a binary tree root and an integer target, delete all the leaf nodes with value target. Note that once you delete a leaf node ...

8:22
Delete Leaves With a Given Value - Post Order Traversal

19 views

3w ago

Electrical & Computer Learning Center, ECL Center
Introduction to Algorithms SMA 5503 - MIT - Lec 17

Lecture 17: Shortest Paths I: Properties, Dijkstra's Algorithm, Breadth-first Search Topics covered: Shortest Paths I: Properties, ...

1:24:36
Introduction to Algorithms SMA 5503 - MIT - Lec 17

35 views

3w ago

Partners DSA
Max Path Sum Between Two Leaves | Post Order | Recursion | Java

Given the root of a binary tree, where each node contains an integer value, find the maximum possible path sum between any two ...

12:23
Max Path Sum Between Two Leaves | Post Order | Recursion | Java

40 views

9d ago

Vu Hung Nguyen (Hưng)
Heap Sort: Visualising In-Place O(N log N) Sorting and Sift-Down

Heap Sort is one of the most reliable and elegant sorting algorithms in computer science. By structuring an unsorted array into a ...

0:42
Heap Sort: Visualising In-Place O(N log N) Sorting and Sift-Down

3 views

8d ago

CH 30: IIT KHARAGPUR 02: Computer Science & Others
Lec-01Fundamentals of Algorithms #swayamprabha

Welcome to Swayam Prabha Subject: Computer Science Course Name: Fundamentals of Algorithms Name of Presenter: Prof.

1:00:51
Lec-01Fundamentals of Algorithms #swayamprabha

17 views

2w ago

Show more