Vertitime
- 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.
A “binary tree” is a tree data structure where every node has two child nodes (at the most) that form the tree branches. These child nodes are called left and right child nodes.