قائمة الدروس
- 1- introduction to data structure
- 2- pointer
- 3 - revision for array and pointer
- 4 - revision for struct,array,prefix and postfix
- 5 - revision for class and function
- 6 - stack part 1
- 7 - stack part 2
- 8 - queue part 1
- 9 - queue part 2
- 10 - queue part 3
- 11-circular queue part 1
- 12-circular queue part 2
- 13-linked list part 1
- 14-linked list part 2
- 15-linked list part 3
- 16-linked list part 4
- 17 - introduction to Algorithms and data structures
- 18 - tree part 1 (definitions)
- 19 - tree part 2
- 20 - tree part 3(pre order)
- 21 - tree part 4 (in and post order)
- 22 - complete tree
- 23 - big O notation
- 24 - selection sort
- 25 - Bubble sort
- 26 - insertion sort
- 27 - merge sort
- 28 - heap sort
- 29- Quick sort
- 30 - revision for algorithms sort
- 31 - linear search (unsorted)
- 32- linear search (sorted)
- 33- binary search
- 34-binary tree part 1(search)
- 35-binary tree part 2(insertion and deletion)
- 36-revision algorithms
- 37-AVL part 1 (balanced factor)
- 38-AVL part 2 (balanced tree)
- 39- example for AVL TREE هام جدا
- 40-graph part 1
- 41-graph part 2
- 42-graph part 3
- 43-kruskal algorithms
- 44-prim algorithms
- 45-breadth first search (BFS)
- 46-depth first search (DFS)
- 47-uniform cost search (UCS)
- 48- A* algorithms and finish course
Loading...
