Skip to content

Latest commit

 

History

History
18 lines (18 loc) · 600 Bytes

README.md

File metadata and controls

18 lines (18 loc) · 600 Bytes

Additional library "jgraphx.jar" is under BSD License and was created by https://github.com/jgraph/jgraphx
My source code from src folder is under MIT License.


This program shows how binary search tree works. You can:

  1. Add element (without repetition), random or your own value
  2. Remove element
  3. Find maximum value
  4. Find minimum value
  5. Get leaves count
  6. Get nodes count
  7. Get height
  8. Get predecessor
  9. Get successor
  10. Clear view
  11. Get tree traversals (inOrder, postOrder, preOrder)

    If you want to use GUI you have to add external libarary to the project.