Movatterモバイル変換

[0]ホーム
URL:

Open In App

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.

root

Types of Tree

tree

Basics

Binary Tree

  1. Introduction
  2. Applications of Binary Tree
  3. Properties of Binary Tree
  4. Tyes of Binary Tree
  5. Inorder Traversal
  6. Preorder Traversal
  7. Postorder Traversal
  8. Level Order Tree Traversal
  9. Height or Depth
  10. Level of a Given Node in Tree
  11. Search a Node
  12. Find the Parent
  13. Insertion
  14. Deletion
  15. Enumeration of Binary Trees
  16. Find all Leaf nodes
  17. Array Implementation

Binary Search Tree

  1. Introduction
  2. Applications
  3. Searching
  4. Insertion
  5. Traversals – Inorder, Preorder, Post Order
  6. Deletion
  7. More Problems on Binary Search Tree

AVL Tree

  1. AVL Tree Data Structure
  2. Insertion
  3. Deletion
  4. Weak AVL or Rank Balanced Trees
  5. AVL with duplicate keys
  6. Count greater nodes in AVL tree
  7. How to insert Strings into an AVL Tree
  8. Minimum nodes in an AVL Tree with given height
  9. Optimal sequence for AVL tree insertion
  10. Different shapes of AVL possible at height h

Red-Black Tree

  1. Introduction to Red-Black Tree
  2. Insertion in Red-Black Tree
  3. Red-Black Trees | Top-Down Insertion
  4. Deletion in Red-Black Tree
  5. Applications, Advantages, and Disadvantages of Red-Black 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

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. Children of a Node in an N-ary Tree
  5. Find Siblings in an N-ary Tree
  6. Mirror of n-ary Tree
  7. Diameter of an N-ary Tree
  8. Level Order Traversal of N-ary Tree
  9. Sum of all elements of N-ary Tree
  10. Serialize and Deserialize an N-ary Tree

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

Other types of Trees

Important Links:


TREE DATA STRUCTURES | What is Tree? | DSA Course
Improve
Improve
Article Tags :

Explore

Lightbox
Improvement
Suggest Changes
Help us improve. Share your suggestions to enhance the article. Contribute your expertise and make a difference in the GeeksforGeeks portal.
geeksforgeeks-suggest-icon
Create Improvement
Enhance the article with your expertise. Contribute to the GeeksforGeeks community and help create better learning resources for all.
geeksforgeeks-improvement-icon
Suggest Changes
min 4 words, max Words Limit:1000

Thank You!

Your suggestions are valuable to us.

What kind of Experience do you want to share?

Interview Experiences
Admission Experiences
Career Journeys
Work Experiences
Campus Experiences
Competitive Exam Experiences
[8]ページ先頭
©2009-2025 Movatter.jp