title: NLOC and Complexity numbers during Code Analysis
body: <p>I wrote a code for constructing an  expression tree and traversing the tree in three different ways<br>
  a) Inorder traversal<br>
  b) Postorder Traversal<br>
  c) Level order Traversal  </p>
  
  <p>So, I wanted to know the complexity of my code and found this website which calculates it:<br>
   [ <a href="http://www.lizard.ws/" rel="nofollow noreferrer">http://www.lizard.ws/</a> ]  </p>
  
  <p>These were the results:  </p>
  
  <pre><code>Function Name       NLOC      Complexity     Token #    Parameter #  
  
  faw                  10         6             51    
  push                 12         2             61    
  pushp                12         2             61    
  pop                   5         1             25    
  popp                  5         1             25    
  inorder               9         2             38    
  postorder             9         2             38    
  printLevelOrder       7         2             40    
  printLevel           12         4             66    
  height               15         3             76    
  main                 100        21           738
  </code></pre>
  
  <p><strong>Question:</strong>
  What does NLOC and the numbers for complexity denote? Does having a high number mean, the code isn't well optimized?</p>