
<p>The following programs have been compiled from AM Padma Reddy’s book on Data 
  Structures in C (2003 edition).</p>
<p> I do not deserve much credit for these except for some typing work, and trying 
  out some examples (those provided in the book and some others of my own). I 
  don't say that these are the best or the easiest codes available for the required 
  purpose but i found the book a good collection of source codes, and so i just 
  borrowed some of them.</p>
<p>All these examples would work on some non-standard C++ compilers like Borland 
  C++ 3.0 or any of the latest standard C++ compilers like Borland C++ 5.5 (Free 
  Command line Tools downloadable free at www.borland.com )<br>
  These are basically C programs but for the fact that some comments are shown 
  using the C++ style. To convert them to pure C, just remove all comments and 
  compile. The programs will directly compile on a C++ compiler like Borland C++ 
  3.0 as-is even if the extension of the file is .C if you use the default settings. 
  <br>
</p>
<p> <br>
  List of programs in the zip file : </p>
<p>Sorting<br>
  =====<br>
  Address Calculation Sort<br>
  Heap Sort <br>
  Insertion Sort <br>
  Insertion Sort using 2 files (for input and output) <br>
  Merge Sort<br>
  Quick Sort <br>
  Radix Sort<br>
  Shell Sort </p>
<p>Conversions of the 3 kinds of expressions using stacks :<br>
  =====================================<br>
  Infix to Postfix (didn’t work properly though typed correctly) <br>
  Infix to Prefix <br>
  Postfix to Infix <br>
  Postfix to Prefix <br>
  Prefix to Postfix <br>
  Prefix to Infix <br>
  <br>
  The last 4 of these used 2-d array based stack. </p>
<p>Trees <br>
  ====<br>
  1) Creation and Evaluation of a expression tree – Here a postfix expression 
  entered by the user is automatically converted info a tree and then the tree 
  is evaluated recursively.</p>
<p> 2) The creation and Traversal of a Threaded Binary tree – Here the tree is 
  created by taking the directions explicitly from the user. The traversal is 
  then shown. </p>