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.

Basics
Binary Tree
- Introduction
- Applications
- Properties of Binary Tree
- Tyes of Binary Tree
- Inorder Traversal
- Preorder Traversal
- Postorder Traversal
- Level Order Tree Traversal
- Height or Depth
- Level of a Given Node in Tree
- Search a Node
- Find the Parent
- Insertion
- Deletion
- Enumeration of Binary Trees
- Find all Leaf nodes
- Array Implementation
Binary Search Tree
- Introduction
- Applications
- Searching
- Insertion
- Traversals – Inorder, Preorder, Post Order
- Deletion
- More Problems on Binary Search Tree
AVL Tree
- AVL Tree Data Structure
- Insertion
- Deletion
- Weak AVL or Rank Balanced Trees
- AVL with duplicate keys
- Count greater nodes in AVL tree
- How to insert Strings into an AVL Tree
- Minimum nodes in an AVL Tree with given height
- Optimal sequence for AVL tree insertion
- Different shapes of AVL possible at height h
Red-Black Tree
- Introduction to Red-Black Tree
- Insertion in Red-Black Tree
- Red-Black Trees | Top-Down Insertion
- Deletion in Red-Black Tree
- Applications, Advantages, and Disadvantages
Ternary Search Tree
- Ternary Search Tree
- Ternary Search Tree (Deletion)
- Auto-complete feature using Ternary Search Tree
- Longest word in ternary search tree
n-ary or Generic Tree
- Generic Trees(N-ary Trees)
- Depth of an N-ary Tree
- Children of a Node in an N-ary Tree
- Find Siblings in an N-ary Tree
- Mirror of n-ary Tree
- Diameter of an N-ary Tree
- Level Order Traversal of N-ary Tree
- Sum of all elements of N-ary Tree
- Serialize and Deserialize an N-ary Tree
B Tree
- Introduction of B-Tree
- Insert Operation in B-Tree
- Delete Operation in B-Tree
- B-Tree Insert without aggressive splitting
B+ Tree
Other types of Trees
- Ternary Tree:
- Interval Tree:
- 2-3-4 Tree: