Hey there, :)

Normally whenever I am working on a task requiring a segment tree or some similar data structure problem, and my code does not work, I find myself at a loss for what to do because it seems kind of hard to tell whether or not the segment tree is working properly or not...

I wrote this quick function to print a somewhat simple segment tree, but it feels rather ugly, and I don't think it would be feasible for more complex data structures.

void print_segtree(VI& segtree, string s = "") {
  int siz = (int)segtree.size();
  //0
  //1, 2
  //3, 4, 5, 6
  // 7, 8, 9, 10, 11, 12, 13, 14...
  cout << "Printing seg tree " << s << endl;
  for(int i = 0; i < siz; i++) {
    cout << segtree[i] << " ";
    if(__builtin_popcount(i + 2) == 1) cout << endl;
  }
}

Do you have any functions/scripts that you use to debug data structure problems, and if so, I would appreciate it if you would share it in the comments :p