- Data Structure Introduction
- Data Structure Types
- Data Structure Arrays
- Singly Linked List
- Bubble Sort
- Binary Tree
- Binary Search Tree
- Array vs Linked List
- Stack vs Queue
- Binary Tree vs Binary Search Tree
- Queues
- Lenear Search
- Binary Search
- Stack
- Merge Sort
- Heap Sort
- Quick Sort
- Doubly Linked List
- Cirular Linked List
- Circular Queue
- Avl Tree
- Bucket Sort
- Selection Sort
- Insertion Sort
Binary Tree vs Binary Search Tree.
The Binary Tree works well for efficient and fast lookup of information and data in any tree structure. The Binary Search Tree works well in the cases of deletion, insertion, and searching of the elements.