Skip to content
Log inStart studying

DSA learning path

Advanced Trees

Fenwick trees, segment trees and binary lifting for tree queries.

Start with Dynamic Range Sums with a Fenwick Tree

Problems in this path

  1. Dynamic Range Sums with a Fenwick Tree
    Medium · Fenwick Tree
    Open
  2. Range Minimum with a Segment Tree
    Medium · Iterative Segment Tree
    Open
  3. Lowest Common Ancestor Queries
    Hard · Binary Lifting
    Open
  4. Range Maximum Queries
    Easy · Segment Tree
    Open
  5. Range Additions with Point Queries
    Medium · Lazy Difference Tree
    Open
  6. Kth Ancestor Queries
    Hard · Binary Lifting
    Open
  7. Subtree Sum Queries
    Medium · Euler Tour Flattening
    Open
  8. Kth Value by Frequency
    Hard · Fenwick Order Statistic
    Open
  9. Static Range GCD Queries
    Medium · Sparse Table
    Open
  10. Ancestor Checks with Euler Times
    Medium · DFS Entry and Exit Times
    Open

Read first

Fenwick Trees and Segment Trees

Choose a logarithmic range-query structure, understand its invariant, and avoid index and interval-boundary errors.

20 min read