title: Can clang/gcc optimize linked-list trees?
body: <p>I have a C program that has a tree implemented with linked-lists (child->parent and sibling->sibling).</p>
  
  <p>I'm very green to compiler optimizations. I have seen and read about O-O3 and I think I've read about speeding up nested for loops and such.</p>
  
  <p>If I want to increase performance with my tree implementation, do I need to start thinking about reimplementing it? Or perhaps I can just crunch the compiler?</p>