Skip to content

Data Structures and Algorithms

Trees

Data Structures and Algorithms

Home
Resources
Algorithms
Algorithms
- Flow Chart for solving problem
- Techniques
  Techniques
Analysis
Analysis
Competitive programming
Competitive programming
- Debugging
- Famous Problems
Data structures
Data structures
- Abstract data type
  Abstract data type
  - Dequeue
    
    Dequeue
  - Queue
    
    Queue
  - Stack
    
    Stack
- Arrays
  Arrays
  - Sorting
    
    Sorting
    
    Bubble Sort
    
    Count Sort
    
    Heap Sort
    
    Insertion Sort
    
    Merge Sort
    
    Quick Sort
    
    Radix Sort
    
    Selection Sort
- Graphs
  Graphs
  - Graphs Types
  - Algorithms
    
    Algorithms
    
    Bridges
    Bridges
    
    Bridges
    
    Minimum spanning tree
    Minimum spanning tree
    
    Kruskal
    
    Prims
    
    Shortest path
    Shortest path
    
    Dijkstras Shortest Path Algorithm
    
    Traversal
    Traversal
    
    BFS-Trees
    
    DFS-Trees
  - Dag
    Dag
    
    Topological sort
  - Disjoint union
    Disjoint union
    
    Disjoint Union
- Linked list
  Linked list
- Trees
  Trees
  - Binary tree
    
    Binary tree
    
    Binary heap
    
    Binary heap
    
    Binary search tree
    Binary search tree
    
    Binary Search Tree
    
    Traversal
    
    Traversal
  - Segment tree
    Segment tree
    
    Segment Trees

Trees

Trees is recursive data structure, and algorithm related to trees are often recursive too.

Trees

consists of nodes
each node can have children nodes.
there is only one root node, a node which don't have a parent
if there are more than one root node it is called a forest