title: How to do pre-order and post-order traversal of THREADED binary search tree?
body: <p>Okay, so in-order traversal of threaded binary tree by using threads goes something like this:  </p>
  
  <ol>
  <li>Start at leftmost node and print it</li>
  <li>Follow thread to right and print it</li>
  <li>Follow link to right go to leftmost node and print it</li>
  <li>Follow thread to right and print it</li>
  <li><em>(repeat)</em></li>
  </ol>
  
  <p>But how can I make pre- and post-order traversals using threads?</p>