• ↑↓ pour naviguer
  • ↵ pour ouvrir
  • ⟶ pour sélectionner
  • ⌘ ⌥ ↵ pour ouvrir dans un panneau
  • ←→ pour naviguer
  • esc pour rejeter
⌘ '
raccourcis clavier
semantic not available yet

Tree Data Structure

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.

  • published

  • modified

  • length

    2 min read (379 words)

  • source

    llms.txt

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.

root
root

Basics

Binary Tree

  1. Introduction
  2. Applications
  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

Ternary Search Tree

  1. Ternary Search Tree
  2. Ternary Search Tree (Deletion)
  3. Auto-complete feature using Ternary Search Tree
  4. Longest word in ternary search tree

n-ary or Generic Tree

  1. Generic Trees(N-ary Trees)
  2. Depth of an N-ary Tree
  3. Children of a Node in an N-ary Tree
  4. Find Siblings in an N-ary Tree
  5. Mirror of n-ary Tree
  6. Diameter of an N-ary Tree
  7. Level Order Traversal of N-ary Tree
  8. Sum of all elements of N-ary Tree
  9. Serialize and Deserialize an N-ary Tree

B Tree

  1. Introduction of B-Tree
  2. Insert Operation in B-Tree
  3. Delete Operation in B-Tree
  4. B-Tree Insert without aggressive splitting

B+ Tree

  1. Introduction of B+ Tree
  2. Insertion in a B+ tree
  3. Deletion in B+ Tree

Other types of Trees

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

  1. What is Ternary Tree

  2. Create a Doubly Linked List from a Ternary Tree

  3. Interval Tree

  4. Interval Tree using GNU Tree-based container

  5. 2-3-4 Tree

  6. 2-3 Trees | (Search, Insert, and Deletion)

you might also like

  • 1
  • datagram
  • dns-authoritative-server
  • session-authentication
  • Single Number
  • Index
  • etl-pipeline-dwh
  • System Call
  • T5 Text Encoder
    • DBMS Interview Questions with Answers
    DBMS Interview Questions with Answers A Database Management System (DBMS) is the backbone of modern data storage and management.