title: Maximum number of levels in a Binary Search Tree of Ascii Values?
body: <p>I'm doing a pre-order traversal of a Binary Search Tree where each node contains a unique ASCII character (sorted based upon their decimal value).  </p>
  
  <p>I plan on printing the path to each node by adding a '0' to the path whenever I traverse left and adding '1' whenever I traverse right.  I plan to store this value in an array, but I don't know how to calculate the maximum size of the array.  </p>
  
  <p>If I have this correct, the maximum path size should be equal to the depth of a tree containing every ASCII character in a unique node.  How would I go about calculating the maximum depth?</p>
  
  <p>Note: There are 255 total ASCII values.  </p>