22 - complete tree

دروس الكورس

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