Comparison among different Tree Data Structures
- Difference between General tree and Binary tree
- Difference between Binary Tree and Binary Search Tree
- Difference between Binary tree and B-tree
- Difference between B tree and B+ tree
- Difference between Full and Complete Binary Tree
- Difference between Binary Search Tree and AVL Tree
- Red Black Tree vs AVL Tree
Tree Data Structure
Tree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes.
Table of Content
- What is Tree Data Structure?
- Terminologies In Tree Data Structure
- Types of Tree Data Structure
- Applications of Tree Data Structure
- Basics of Tree Data Structure
- Basic Operations on Tree Data Structure
- n-ary or Generic Tree
- Binary Tree
- Binary Search Tree
- Ternary Search Tree
- AVL Tree
- B+ Tree
- Red-Black Tree
- Other types of Trees
- Trees vs other Data Structures
- Comparison among different Tree Data Structures
- Problems based on Tree Data Structure