Skip to content

Trees Overview

This section contains documentation for tree data structures.

Available Trees

  • Binary Tree: General binary tree with common operations
  • Binary Search Tree: Binary Tree with efficient search, insertion, and deletion operations.
  • Heap: Specialized tree-based data structure that satisfies the heap property.
  • Priority Queue: A priority queue is an abstract data type where each element has a priority. Uses Heap internally.