title: C++ What is the best data structure for a two dimensional array of object "piles"?
body: <p>The size of the grid will be known at the start (but will be different each time the program starts). However, the DEPTH of each cell is not a mere value, but rather a population of objects that will vary constantly during runtime.</p>
  
  <p>Q: What is the most recommended (efficient and easy to maintain; less prone to user error) way of implementing this ?</p>
  
  <ul>
  <li>Is this some kind of a standard 2D array of vector pointers ?</li>
  <li>Is it a 3D Vector array ?</li>
  <li>Is it a 2D array of linked lists, or binary trees (I am thinking binary trees will add complexity overhead because of continuous deletion and insertion node-gymnastics)</li>
  <li>Is it some other custom data structure ?</li>
  </ul>
  
  <p><img src="https://i.stack.imgur.com/UDPOU.png" alt="enter image description here"></p>