|Submitted on: 7/2/2003 10:20:13 AM |
By: Fabian Jones
By 1 Users
Compatibility:Java (JDK 1.2)
Users have accessed this code 2708 times.
|(About the author)|
| ***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.<br>
- Cleaned up the code and added numerous comments
- Small changes<br>
- no inorder, preorder, postorder support, that's coming next<br>
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.<br>
***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!***|
HTML: 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
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 including:McAfee.com
Terms of Agreement:
By using this code, you agree to the following terms...
1) You may use
this code in your own programs (and may compile it into a program and distribute it in compiled format for languages that allow it) freely and with no charge.
2) You MAY NOT redistribute this code (for example to a web site) without written permission from the original author. Failure to do so is a violation of copyright laws.
3) You may link to this code from another website, but ONLY if it is not wrapped in a frame.
4) You will abide by any additional copyright restrictions which the author may have placed in the code or code's description.
Other 4 submission(s) by this author
|Report Bad Submission|
See Voting Log |
|Other User Comments|
|7/2/2003 2:09:47 PM:Fabian Jones|
Please leave a comment, I am interested
in what you think. Thanks.
| Add Your Feedback! |
|Note:Not only will your feedback be posted, but an email will be sent to the code's author in your name. |
NOTICE: The author of this code has been kind enough to share it with you. If you have a criticism, please state it politely or it will be deleted.
For feedback not related to this particular code, please click here.