Add resources for queue, hash, tree and heap data structures

2 years ago · 64e9abd20a
parent 681ff8147e
commit 64e9abd20a
10 changed files with 83 additions and 9 deletions
--- a/content/roadmaps/103-computer-science/content/102-data-structures/103-queue.md
+++ b/content/roadmaps/103-computer-science/content/102-data-structures/103-queue.md
@ -2,3 +2,10 @@

 Queue is a linear collection of items where items are inserted and removed in a particular order. The queue is also called a FIFO Data Structure because it follows the "First In, First Out" principle i.e., the item that is inserted in the first is the one that is taken out first.

+<ResourceGroupTitle>Free Content</ResourceGroupTitle>
+<BadgeLink colorScheme='red' badgeText='Watch' href='https://www.youtube.com/watch?v=mDCi1lXd9hc'>Queue Data Structure | Illustrated Data Structures</BadgeLink>
+<BadgeLink colorScheme='red' badgeText='Watch' href='https://www.youtube.com/watch?v=D6gu-_tmEpQ'>Queue in 3 Minutes</BadgeLink>
+<BadgeLink colorScheme='red' badgeText='Watch' href='https://www.coursera.org/lecture/data-structures/queues-EShpq'>Queues - Coursera</BadgeLink>
+<BadgeLink colorScheme='yellow' badgeText='Read' href='https://en.wikipedia.org/wiki/Circular_buffer'>Circular Buffer - Wikipedia</BadgeLink>
+
+
--- a/content/roadmaps/103-computer-science/content/102-data-structures/104-hash-table.md
+++ b/content/roadmaps/103-computer-science/content/102-data-structures/104-hash-table.md
@ -1 +1,14 @@
-# Hash table
+# Hash Table
+
+Hash Table, Map, HashMap, Dictionary or Associative are all the names of the same data structure. It is one of the most commonly used data structures.
+
+<ResourceGroupTitle>Free Content</ResourceGroupTitle>
+<BadgeLink colorScheme='red' badgeText='Watch' href='https://www.youtube.com/watch?v=jalSiaIi8j4'>Hash Table | Illustrated Data Structures</BadgeLink>
+<BadgeLink colorScheme='red' badgeText='Watch' href='https://youtu.be/knV86FlSXJ8'>Hash Table in 4 Minutes</BadgeLink>
+<BadgeLink colorScheme='red' badgeText='Watch' href='https://www.youtube.com/watch?v=0M_kIqhwbFo&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=9'>Hashing with Chaining</BadgeLink>
+<BadgeLink colorScheme='red' badgeText='Watch' href='https://www.youtube.com/watch?v=BRO7mVIFt08&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=10'>Table Doubling, Karp-Rabin</BadgeLink>
+<BadgeLink colorScheme='red' badgeText='Watch' href='https://www.youtube.com/watch?v=rvdJDijO2Ro&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=11'>Open Addressing, Cryptographic Hashing</BadgeLink>
+<BadgeLink colorScheme='red' badgeText='Watch' href='https://www.youtube.com/watch?v=C4Kc8xzcA68'>PyCon 2010: The Mighty Dictionary</BadgeLink>
+<BadgeLink colorScheme='red' badgeText='Watch' href='https://www.youtube.com/watch?v=66P5FMkWoVU'>PyCon 2017: The Dictionary Even Mightier</BadgeLink>
+<BadgeLink colorScheme='red' badgeText='Watch' href='https://www.youtube.com/watch?v=z0lJ2k0sl1g&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=11'>(Advanced) Randomization: Universal & Perfect Hashing</BadgeLink>
+<BadgeLink colorScheme='red' badgeText='Watch' href='https://www.youtube.com/watch?v=N0COwN14gt0&list=PL2B4EEwhKD-NbwZ4ezj7gyc_3yNrojKM9&index=4'>(Advanced) Perfect hashing</BadgeLink>
--- a/content/roadmaps/103-computer-science/content/102-data-structures/105-tree/100-binary-tree.md
+++ b/content/roadmaps/103-computer-science/content/102-data-structures/105-tree/100-binary-tree.md
@ -1 +1,6 @@
-# Binary tree
+# Binary Tree
+
+A binary tree is a tree data structure in which each node has at most two children, which are referred to as the left child and the right child.
+
+<BadgeLink colorScheme='red' badgeText='Watch' href='https://www.youtube.com/watch?v=76dhtgZt38A&list=PLUl4u3cNGP63EdVPNLG3ToM6LaEUuStEY&index=9'>Binary Trees - Part 1</BadgeLink>
+<BadgeLink colorScheme='red' badgeText='Watch' href='https://www.youtube.com/watch?v=U1JYwHcFfso&list=PLUl4u3cNGP63EdVPNLG3ToM6LaEUuStEY&index=10'>Binary Trees - Part 2</BadgeLink>
--- a/content/roadmaps/103-computer-science/content/102-data-structures/105-tree/101-binary-search-tree.md
+++ b/content/roadmaps/103-computer-science/content/102-data-structures/105-tree/101-binary-search-tree.md
@ -1 +1,14 @@
-# Binary search tree
+# Binary Search Tree
+
+A binary search tree, also called an ordered or sorted binary tree, is a rooted binary tree data structure with the key of each internal node being greater than all the keys in the respective node's left subtree and less than the ones in its right subtree.
+
+<ResourceGroupTitle>Free Content</ResourceGroupTitle>
+<BadgeLink colorScheme='red' badgeText='Watch' href='https://www.youtube.com/watch?v=S2W3SXGPVyU'>Tree | Illustrated Data Structures</BadgeLink>
+<BadgeLink colorScheme='red' badgeText='Watch' href='https://www.coursera.org/learn/data-structures/lecture/E7cXP/introduction'>Binary Search Trees - Coursera</BadgeLink>
+<BadgeLink colorScheme='red' badgeText='Watch' href='https://www.youtube.com/watch?v=76dhtgZt38A'>Binary Search Trees - MIT</BadgeLink>
+<BadgeLink colorScheme='red' badgeText='Watch' href='https://www.youtube.com/watch?v=COZK7NATh4k&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P&index=29'>Binary Search Tree Implementation in C++</BadgeLink>
+<BadgeLink colorScheme='red' badgeText='Watch' href='https://www.youtube.com/watch?v=hWokyBoo0aI&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P&index=30'>BST implementation - memory allocation in stack and heap</BadgeLink>
+<BadgeLink colorScheme='red' badgeText='Watch' href='https://www.youtube.com/watch?v=Ut90klNN264&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P&index=31'>Find Min and Max Element in Binary Search Tree</BadgeLink>
+<BadgeLink colorScheme='red' badgeText='Watch' href='https://www.youtube.com/watch?v=yEwSGhSsT0U&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P&index=36'>Check if Given Tree is Binary Search Tree or Not</BadgeLink>
+<BadgeLink colorScheme='red' badgeText='Watch' href='https://www.youtube.com/watch?v=gcULXE7ViZw&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P&index=37'>Delete an Element from Binary Search Tree</BadgeLink>
+<BadgeLink colorScheme='red' badgeText='Watch' href='https://www.youtube.com/watch?v=5cPbNCrdotA&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P&index=38'>Inorder Successor in a binary search tree</BadgeLink>
--- a/content/roadmaps/103-computer-science/content/102-data-structures/105-tree/102-full-binary-tree.md
+++ b/content/roadmaps/103-computer-science/content/102-data-structures/105-tree/102-full-binary-tree.md
@ -1 +1,7 @@
-# Full binary tree
+# Full Binary Tree
+
+A full Binary tree is a special type of binary tree in which every parent node/internal node has either two or no children. It is also known as a proper binary tree.
+
+<ResourceGroupTitle>Free Content</ResourceGroupTitle>
+<BadgeLink colorScheme='yellow' badgeText='Read' href='https://www.programiz.com/dsa/full-binary-tree'>Full Binary Tree</BadgeLink>
+<BadgeLink colorScheme='yellow' badgeText='Read' href='https://www.geeksforgeeks.org/types-of-binary-tree/'>Types of Binary Tree</BadgeLink>
--- a/content/roadmaps/103-computer-science/content/102-data-structures/105-tree/103-complete-binary-tree.md
+++ b/content/roadmaps/103-computer-science/content/102-data-structures/105-tree/103-complete-binary-tree.md
@ -1 +1,7 @@
-# Complete binary tree
+# Complete Binary Tree
+
+A complete binary tree is a special type of binary tree where all the levels of the tree are filled completely except the lowest level nodes which are filled from as left as possible.
+
+<ResourceGroupTitle>Free Content</ResourceGroupTitle>
+<BadgeLink colorScheme='yellow' badgeText='Read' href='https://www.geeksforgeeks.org/complete-binary-tree'>Complete Binary Tree - Geeks for Geeks</BadgeLink>
+<BadgeLink colorScheme='yellow' badgeText='Read' href='https://www.programiz.com/dsa/complete-binary-tree'>Complete Binary Tree - Programiz</BadgeLink>
--- a/content/roadmaps/103-computer-science/content/102-data-structures/105-tree/104-balanced-tree.md
+++ b/content/roadmaps/103-computer-science/content/102-data-structures/105-tree/104-balanced-tree.md
@ -1 +1,6 @@
-# Balanced tree
+# Balanced Tree
+
+A balanced binary tree, also referred to as a height-balanced binary tree, is defined as a binary tree in which the height of the left and right subtree of any node differ by not more than 1.
+
+<ResourceGroupTitle>Free Content</ResourceGroupTitle>
+<BadgeLink colorScheme='yellow' badgeText='Read' href='https://www.programiz.com/dsa/balanced-binary-tree'>Balanced Binary Tree</BadgeLink>
--- a/content/roadmaps/103-computer-science/content/102-data-structures/105-tree/105-unbalanced-tree.md
+++ b/content/roadmaps/103-computer-science/content/102-data-structures/105-tree/105-unbalanced-tree.md
@ -1 +1,6 @@
-# Unbalanced tree
+# Unbalanced Tree
+
+An unbalanced binary tree is one that is not balanced.
+
+<ResourceGroupTitle>Free Content</ResourceGroupTitle>
+<BadgeLink colorScheme='yellow' badgeText='Read' href='https://www.programiz.com/dsa/balanced-binary-tree'>Balanced Binary Tree</BadgeLink>
--- a/content/roadmaps/103-computer-science/content/102-data-structures/105-tree/readme.md
+++ b/content/roadmaps/103-computer-science/content/102-data-structures/105-tree/readme.md
@ -1 +1,7 @@
-# Tree
+# Tree
+
+A tree is non-linear and a hierarchical data structure consisting of a collection of nodes such that each node of the tree stores a value and a list of references to other nodes (the “children”).
+
+<ResourceGroupTitle>Free Content</ResourceGroupTitle>
+<BadgeLink colorScheme='yellow' badgeText='Read' href='https://www.geeksforgeeks.org/introduction-to-tree-data-structure-and-algorithm-tutorials/'>Tree Data Structure - Geeks for Geeks</BadgeLink>
+<BadgeLink colorScheme='red' badgeText='Watch' href='https://www.youtube.com/watch?v=S2W3SXGPVyU'>Tree | Illustrated Data Structures</BadgeLink>
--- a/content/roadmaps/103-computer-science/content/102-data-structures/107-heap.md
+++ b/content/roadmaps/103-computer-science/content/102-data-structures/107-heap.md
@ -1 +1,9 @@
-# Heap
+# Heap
+
+Heap is a tree-based data structure that follows the properties of a complete binary tree and is either a Min Heap or a Max Heap.
+
+<ResourceGroupTitle>Free Content</ResourceGroupTitle>
+<BadgeLink colorScheme='red' badgeText='Watch' href='https://www.youtube.com/watch?v=F_r0sJ1RqWk'>Heap | Illustrated Data Structures</BadgeLink>
+<BadgeLink colorScheme='red' badgeText='Watch' href='https://www.coursera.org/lecture/data-structures/introduction-2OpTs'>Priority Queue - Introduction</BadgeLink>
+<BadgeLink colorScheme='red' badgeText='Watch' href='https://www.youtube.com/watch?v=B7hVxCmfPtM&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=5'>Heaps and Heap Sort</BadgeLink>
+<BadgeLink colorScheme='red' badgeText='Watch' href='https://archive.org/details/ucberkeley_webcast_yIUFT6AKBGE'>CS 61B Lecture 24: Priority Queues</BadgeLink>