Resource Detail

Go Back Return to Home

Pluralsight - Algorithms and Data Structures - Part 1

Size 328.62 MB

Files 69

Info Hash: 498E058F2D66B7128549668A027B7706843CD45A

Indexed 2024-12-28 05:18:54

Updated 2024-12-28 05:18:54

📂 File List (69)

🎬

01. Introduction.wmv

0 B

🎬

02. Node Chains.wmv

0 B

🎬

03. Code - Node Chains.wmv

0 B

🎬

04. Linked List.wmv

0 B

🎬

05. Add Items.wmv

0 B

🎬

06. Remove Items.wmv

0 B

🎬

07. Enumerate.wmv

0 B

🎬

08. Code - Singly Linked List.wmv

0 B

🎬

09. Doubly Linked List.wmv

0 B

🎬

10. Code - Doubly Linked List.wmv

0 B

🎬

11. Modern Implementations.wmv

0 B

🎬

12. Summary and References.wmv

0 B

📄

index.m3u

0 B

🎬

01. Introduction.wmv

0 B

🎬

02. Push & Pop.wmv

0 B

🎬

03. Stack (Linked List).wmv

0 B

🎬

04. Code - Stack (Linked List).wmv

0 B

🎬

05. Stack (Array).wmv

0 B

🎬

06. Code - Stack (Array).wmv

0 B

🎬

07. Postfix Calculator.wmv

0 B

🎬

08. Demo - Postfix Calculator.wmv

0 B

🎬

09. Demo - Undo.wmv

0 B

🎬

10. Other Implementations.wmv

0 B

🎬

11. Summary and Reference.wmv

0 B

📄

index.m3u

0 B

🎬

01. Introduction.wmv

0 B

🎬

02. Enqueue and Dequeue.wmv

0 B

🎬

03. Linked List Implementation.wmv

0 B

🎬

04. Code - Linked List Implementation.wmv

0 B

🎬

05. Demo - Queue.wmv

0 B

🎬

06. Array Implementation.wmv

0 B

🎬

07. Code - Array Implementation.wmv

0 B

🎬

08. Priority Queue.wmv

0 B

🎬

09. Code - Priority Queue.wmv

0 B

🎬

10. Demo - Priority Queue.wmv

0 B

🎬

11. .NET and C++.wmv

0 B

🎬

12. Summary and Reference.wmv

0 B

📄

index.m3u

0 B

🎬

01. Introduction.wmv

0 B

🎬

02. What is a Tree.wmv

0 B

🎬

03. Binary Trees.wmv

0 B

🎬

04. Adding Data.wmv

0 B

🎬

05. Finding Data.wmv

0 B

🎬

06. Removing Data.wmv

0 B

🎬

07. Traversals.wmv

0 B

🎬

08. Code - Binary Tree.wmv

0 B

🎬

09. Demo - Sorting Words.wmv

0 B

🎬

10. Summary.wmv

0 B

📄

index.m3u

0 B

🎬

01. Introduction.wmv

0 B

🎬

02. Hash Tables.wmv

0 B

🎬

03. Hashing Overview.wmv

0 B

🎬

04. String Hashing.wmv

0 B

🎬

05. Demo - String Hashing.wmv

0 B

🎬

06. Adding Data.wmv

0 B

🎬

07. Handling Collisions.wmv

0 B

🎬

08. Growing the Table.wmv

0 B

🎬

09. Removing Data.wmv

0 B

🎬

10. Finding Data.wmv

0 B

🎬

11. Enumerating.wmv

0 B

🎬

12. Code - Hash Table.wmv

0 B

🎬

13. Demo - Counting Words.wmv

0 B

🎬

14. Summary.wmv

0 B

📄

index.m3u

0 B

📄

slides-robert-horvick-ads-binarytree.pdf

0 B

📄

slides-robert-horvick-ads-hashtable.pdf

0 B

📄

slides-robert-horvick-ads-linked-list.pdf

0 B

📄

slides-robert-horvick-ads-stack.pdf

0 B

📄

slides-robert-horvick-algods-queue.pdf

0 B

⬇️ Offline Download

Disclaimer

This website only provides DHT network resource indexing services and does not store any resource files. All resources come from the DHT network, and this site cannot control their content. Please comply with local laws and regulations and use network resources rationally. If there are copyright issues, please contact [email protected].