data structures for beginners

vinod’s work on data structures

  • a

  • Archives

«
»

Binary Tree Traversals

Posted by Vinod on May 29, 2006

Binary TreeThis program is for creating and traversing a binary tree in preorder,inorder,postorder using recursion and level order using iteration

This entry was posted on May 29, 2006 at 3:26 pm and is filed under Trees. You can follow any responses to this entry through the RSS 2.0 feed. You can leave a response, or trackback from your own site.

One Response to “Binary Tree Traversals”

  1. hjieboy85 said

    June 24, 2008 at 5:46 pm

    good

Leave a Reply

You must be logged in to post a comment.

«
»