Tree Data Structure

Tree Data Structure is a hierarchical 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.

Tree Data Structure

Introduction to Tree Data Structure:

1. Introduction to Tree – Data Structure and Algorithm Tutorials
2. What is Tree | Tree Definition & Meaning in DSA
3. Types of Trees in Data Structures
4. Applications of tree data structure
5. Applications, Advantages, and Disadvantages of Tree

Basic Operations on Tree Data Structure:

1. Height of Tree
2. Height and Depth of Node
3. Level of a Given Node in Tree
4. Search a Node in Tree
5. Find the Parent of a Node
6. Diameter of a Tree
7. Find all Leaf nodes
8. Find Siblings of a Node
9. Find Children of a Node
10. Tree Traversals (Inorder, Preorder and Postorder)

Types of Tree Data Structure:

• Binary tree: In a binary tree, each node can have a maximum of two children linked to it. Some common types of binary trees include full binary trees, complete binary trees, balanced binary trees, and degenerate or pathological binary trees.
• Ternary Tree: A Ternary Tree is a tree data structure in which each node has at most three child nodes, usually distinguished as “left”, “mid” and “right”.
• N-ary Tree or Generic Tree: Generic trees are a collection of nodes where each node is a data structure that consists of records and a list of references to its children(duplicate references are not allowed). Unlike the linked list, each node stores the address of multiple nodes.

To learn more about types of trees, refer to this article.

n-ary or Generic Tree:

1. Generic Trees(N-ary Trees)
2. What is Generic Tree or N-ary Tree
3. Depth of an N-ary Tree
4. Mirror of n-ary Tree
5. Diameter of an N-ary Tree
6. Level Order Traversal of N-ary Tree
7. Sum of all elements of N-ary Tree
8. Serialize and Deserialize an N-ary Tree

Binary Tree:

1. Introduction to Binary Tree – Data Structure and Algorithm Tutorials
2. Properties of Binary Tree
3. Types of Binary Tree
4. Applications, Advantages and Disadvantages of Binary Tree
5. Binary Tree (Array implementation)
6. Level Order Tree Traversal
7. Inorder Traversal of Binary Tree
8. Preorder Traversal of Binary Tree
9. Postorder Traversal of Binary Tree
10. Insertion in a Binary Tree
11. Deletion in a Binary Tree
12. Enumeration of Binary Trees

Binary Search Tree:

1. Introduction to Binary Search Tree – Data Structure and Algorithm Tutorials
2. Applications of BST
3. Application, Advantages and Disadvantages of Binary Search Tree
4. Insertion in Binary Search Tree
5. Searching in Binary Search Tree
6. Binary Search Tree (BST) Traversals – Inorder, Preorder, Post Order
7. Deletion in Binary Search Tree

Ternary Search Tree:

1. Ternary Search Tree
2. Ternary Search Tree meaning & definition in DSA
3. Ternary Search Tree (Deletion)
4. How to implement text Auto-complete feature using Ternary Search Tree
5. Longest word in ternary search tree

AVL Tree:

1. AVL Tree Data Structure
2. What is AVL Tree | AVL Tree meaning
3. Insertion in an AVL Tree
4. Deletion in an AVL Tree
5. Weak AVL or Rank Balanced Trees
6. Insertion, Searching and Deletion in AVL trees containing a parent node pointer
7. AVL with duplicate keys
8. Count greater nodes in AVL tree
9. How to insert Strings into an AVL Tree
10. Minimum number of nodes in an AVL Tree with given height
11. Optimal sequence for AVL tree insertion (without any rotations)
12. Different shapes of AVL possible at height h

B Tree:

1. Introduction of B-Tree
2. What is B-Tree? | B-Tree meaning
3. Insert Operation in B-Tree
4. Delete Operation in B-Tree
5. B-Tree Insert without aggressive splitting

B+ Tree:

1. Introduction of B+ Tree
2. What is B+ Tree | B+ Tree meaning
3. Insertion in a B+ tree
4. Deletion in B+ Tree

Red-Black Tree:

1. Introduction to Red-Black Tree
2. Red-Black Tree Definition & Meaning in DSA
3. Insertion in Red-Black Tree
4. Red-Black Trees | Top-Down Insertion
5. Deletion in Red-Black Tree
6. Applications, Advantages, and Disadvantages of Red-Black Tree

Other types of Trees:

• Ternary Tree:
  1. What is Ternary Tree
  2. Create a Doubly Linked List from a Ternary Tree
• Interval Tree:
  1. Interval Tree
  2. Interval Tree using GNU Tree-based container
• 2-3-4 Tree:
  1. 2-3-4 Tree
  2. 2-3 Trees | (Search, Insert, and Deletion)

Trees vs other Data Structures:

1. Difference between graph and tree
2. Comparison between Heap and Tree
3. What is the difference between Heap and Red-Black Tree?
4. Difference between Binary Search Tree and Binary Heap
5. Difference between Stack and Tree
6. Difference between an array and a tree

Comparison among different Tree Data Structures:

1. Difference between General tree and Binary tree
2. Difference between Binary Tree and Binary Search Tree
3. Difference between Binary tree and B-tree
4. Difference between B tree and B+ tree
5. Difference between Full and Complete Binary Tree
6. Difference between Binary Search Tree and AVL Tree
7. Red Black Tree vs AVL Tree

Problems based on Tree Data Structure:

Quick Links:

• Practice problems on Trees
• Videos on Trees
• Quizzes on Tree