winzip icon

Binary Search Tree 1.0

Submitted on: 1/3/2015 1:11:00 PM
By: Fabian Jones (from psc cd)  
Level: Intermediate
User Rating: By 5 Users
Compatibility: Java (JDK 1.2)
Views: 5971
     ***Version 1.0*** Traversing the tree is now available. PreOrder, InOrder, and PostOrder traversing is now available. The next version will be a GUI showing the operations being performed on the tree.
***Version 0.7***
- Cleaned up the code and added numerous comments - Small changes
- no inorder, preorder, postorder support, that's coming next
This is an implementation of a Binary Search Tree. Comes with two classes, BSTNode which represents a node in the binary search tree. Also comes with BSTree, the actual Binary Search Tree class. Several methods are supported. Nodes can be inserted, deleted and found.
***Please note, this has no comments and does not have an inorder, preorder, postorder method yet, this is only version 0.5. I just got tired of seeing only two versions of BST in the Java section of PSC and made my own. I hope you find this helpful. Give me feedback!***


Can't Copy and Paste this?
Click here for a copy-and-paste friendly version of this code!
//HTML for :Binary Search Tree 1.0
winzip iconDownload code

Note: Due to the size or complexity of this submission, the author has submitted it as a .zip file to shorten your download time. Afterdownloading it, you will need a program like Winzip to decompress it.Virus note:All files are scanned once-a-day by Planet Source Code for viruses, but new viruses come out every day, so no prevention program can catch 100% of them. For your own safety, please:
  1. Re-scan downloaded files using your personal virus checker before using it.
  2. NEVER, EVER run compiled files (.exe's, .ocx's, .dll's etc.)--only run source code.

If you don't have a virus scanner, you can get one at many places on the net

Report Bad Submission
Use this form to tell us if this entry should be deleted (i.e contains no code, is a virus, etc.).
This submission should be removed because:

Your Vote

What do you think of this code (in the Intermediate category)?
(The code with your highest vote will win this month's coding contest!)
Excellent  Good  Average  Below Average  Poor (See voting log ...)

Other User Comments

 There are no comments on this submission.

Add Your Feedback
Your feedback will be posted below and an email sent to the author. Please remember that the author was kind enough to share this with you, so any criticisms must be stated politely, or they will be deleted. (For feedback not related to this particular code, please click here instead.)

To post feedback, first please login.