
▶︎
RSA cryptography RSA التشفير باستخدام

▶︎
2.6.3 Heap - Heap Sort - Heapify - Priority Queues

▶︎
شرح وحل مثال خوارزمية Prim's algorithm - Minimum spanning tree

▶︎
All Nodes Distance K in Binary Tree | Leetcode | DSA Revision Series

▶︎
K-d Trees - Computerphile

▶︎
مثال على AVL tree

▶︎
4.6 BCD adderشرح تصميم منطفي بالعربي

▶︎
شرح وحل مثال خوارزمية Bellman-Ford Algorithm
![#022 [Data Structures] - AVL Trees (Hieght Balanced Tree): Insertion , Rotation(LL,RR,LR,RL)](https://i.ytimg.com/vi/br-1squJfkA/hqdefault.jpg?sqp=-oaymwEjCNACELwBSFryq4qpAxUIARUAAAAAGAElAADIQj0AgKJDeAE=&rs=AOn4CLC6dJ4yO01NQuhDNO-vo5x8Z7C-fA)
▶︎
#022 [Data Structures] - AVL Trees (Hieght Balanced Tree): Insertion , Rotation(LL,RR,LR,RL)

▶︎
لماذا ينسى البعض ويتذكر الآخرون كل شيء؟
![#029 [Data Structures] - Heap Sort Algorithm(Heapify,Build heap,Max-Min heap) With Implementation](https://i.ytimg.com/vi/REOsj0nYWKE/hqdefault.jpg?sqp=-oaymwEjCNACELwBSFryq4qpAxUIARUAAAAAGAElAADIQj0AgKJDeAE=&rs=AOn4CLBH1e42YY4kRdN9Ut3EKBCfN5mdyQ)
▶︎
#029 [Data Structures] - Heap Sort Algorithm(Heapify,Build heap,Max-Min heap) With Implementation

▶︎
Understanding B-Trees: The Data Structure Behind Modern Databases

▶︎
Red Black Tree شجرة الاحمر والاسود

▶︎
شرح فرز الكومة (بناء الشجره و الmax ) خوارزميات Heap sort ,heapify and heap max algorithm
![#021 [Data Structures] - Binary Search Tree(Insert-Delete-Search),Find:Successor-Predecessor-Max-Min](https://i.ytimg.com/vi/MikbKCPVsBY/hqdefault.jpg?sqp=-oaymwEjCNACELwBSFryq4qpAxUIARUAAAAAGAElAADIQj0AgKJDeAE=&rs=AOn4CLCPfyZMSxuM2iFH5lgmlFIlrCb1Bg)
▶︎
#021 [Data Structures] - Binary Search Tree(Insert-Delete-Search),Find:Successor-Predecessor-Max-Min

▶︎
Heap Sort (Heapify Method | Build Max Heap Algorithm) شرح بالعربي

▶︎
Heap sort visualization | What is heap sort and How does it work??

▶︎
07 - Heap Sort | Heapify and build max-heap and time complexity

▶︎
