Data Structures - Full Course Using C and C++

Data Structures - Full Course Using C and C++

freeCodeCamp.org via freeCodeCamp Direct link

Reverse a linked list using recursion

11 of 42

11 of 42

Reverse a linked list using recursion

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

Data Structures - Full Course Using C and C++

Automatically move to the next video in the Classroom when playback concludes

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

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.