Never stop talking " STOP the Gaza Genocide "

Data Structures | mycodeschool

mycodeschool

mycodeschool

mycodeschool is an educational initiative. Our aim is to present some core concepts of computer programming through illustrated examples and creative teaching techniques. . You can send your feedback to mycodeschool [at] gmail [dot] com. Visit: www.mycodeschool.com. Some good resources to learn and practice programming:. TopCoder - http://community.topcoder.com/tc . Codeforces - http://codeforces.com/. Some good resources to practice for programming interviews:. Nice article on how

Course Details

Course Lessons

  1. 1 | Introduction to data structures 02:06:33
  2. 2 | Data Structures: List as abstract data type 02:13:08
  3. 3 | Introduction to linked list 02:17:13
  4. 4 | Data Structures: Arrays vs Linked Lists 02:12:16
  5. 5 | Linked List - Implementation in C/C++ 02:13:58
  6. 6 | Linked List in C/C++ - Inserting a node at beginning 02:12:50
  7. 7 | Linked List in C/C++ - Insert a node at nth position 02:15:15
  8. 8 | Linked List in C/C++ - Delete a node at nth position 02:12:30
  9. 9 | Reverse a linked list - Iterative method 02:13:50
  10. 10 | Print elements of a linked list in forward and reverse order using recursion 02:14:24
  11. 11 | Reverse a linked list using recursion 02:08:55
  12. 12 | Data structures: Introduction to Doubly Linked List 02:07:13
  13. 13 | Doubly Linked List - Implementation in C/C++ 02:15:21
  14. 14 | Data structures: Introduction to stack 02:08:26
  15. 15 | Data structures: Array implementation of stacks 02:13:09
  16. 16 | Data Structures: Linked List implementation of stacks 02:10:58
  17. 17 | Reverse a string or linked list using stack. 02:16:25
  18. 18 | Check for balanced parentheses using stack 02:14:13
  19. 19 | Infix, Prefix and Postfix 02:13:38
  20. 20 | Evaluation of Prefix and Postfix expressions using stack 02:14:10
  21. 21 | Infix to Postfix using stack 02:18:20
  22. 22 | Data structures: Introduction to Queues 02:09:19
  23. 23 | Data structures: Array implementation of Queue 02:14:59
  24. 24 | Data structures: Linked List implementation of Queue 02:14:17
  25. 25 | Data structures: Introduction to Trees 02:15:50
  26. 26 | Data structures: Binary Tree 02:16:17
  27. 27 | Data structures: Binary Search Tree 02:19:28
  28. 28 | Binary search tree - Implementation in C/C++ 02:18:36
  29. 29 | BST implementation - memory allocation in stack and heap 02:13:04
  30. 30 | Find min and max element in a binary search tree 02:05:48
  31. 31 | Find height of a binary tree 02:07:09
  32. 32 | Binary tree traversal - breadth-first and depth-first strategies 02:11:54
  33. 33 | Binary tree: Level Order Traversal 02:11:23
  34. 34 | Binary tree traversal: Preorder, Inorder, Postorder 02:14:29
  35. 35 | Check if a binary tree is binary search tree or not 02:16:30
  36. 36 | Delete a node from Binary Search Tree 02:18:27
  37. 37 | Inorder Successor in a binary search tree 02:17:58
  38. 38 | Data structures: Introduction to graphs 02:16:43
  39. 39 | Data structures: Properties of Graphs 02:15:16
  40. 40 | Graph Representation part 01 - Edge List 02:13:45
  41. 41 | Graph Representation part 02 - Adjacency Matrix 02:14:45
  42. 42 | Graph Representation part 03 - Adjacency List 02:27:50
    Student Reviews

    ( 5 Of 5 )

    1 review
    5 Stars
    100%
    4 Stars
    0%
    3 Stars
    0%
    2 Stars
    0%
    1 Star
    0%
    Y
    Youtube

    02-07-2024
    Data structures

    In this series of lessons, we will study and implement data structures. We will be implementing these data structures in c or c++. Pre-requisite for this lesson is good understanding of pointers in C. Watch this series on pointers before starting on this series: http://www.youtube.com/playlist?listPL2_aWCzGMAwLZp6LMUKI3cc7pgGsasm2_