+1 480 409 0818 

The exhaustive list of topics in Data Structures in which we provide Help with Homework Assignment and Help with Project is as follows: 

  • Dynamic optimality
    • Independent rectangle
    • Wilber
    • Signed Greedy lower bounds
  • Key
  • O(lg lg n)-competitive Tango trees
  • Geometric data structures
    • Orthogonal range queries
    • Range trees
    • Fractional cascading
    • Stabbing queries
    • Interval trees
    • Segment trees
    • Priority search trees
    • Windowing
    • Kinetic data structures and ray shooting
    • Ray shooting
    • Partition trees
  • Strings
    • Suffix tree
    • Suffix array
    • Document retrieval
    • Level ancestor
    •  Static LCA
  • Integers
    • Van Emde Boas
    • Y-fast trees
    • Fusion trees
    • Predecessor lower bound via round elimination
    • Sorting in linear time for w = O(lg2+e n)
    •  Priority queues
    • Tree decompositions
    •  Marked ancestor upper bound
    • Decremental connectivity in trees
  • Dynamic graphs
    • Dynamic trees
    • Euler tour trees
    • Dynamic connectivity in O(lg2 n)
    • O(lg n) lower bound for dynamic connectivity
  • Temporal data structures
  • Persistence, retroactivity
  • External memory / cache-oblivious
  • B-trees
  • Ordered-file maintenance
  • List labeling
  • Order queries
  • Priority queues
  • Succinct data structures
    • Rank
    • Select
    • Tries
  • Succinct data structures
  • Compact suffix arrays and trees