Skip to content

BinaryVision, a Java-based Binary Search Tree (BST) visualizer using Swing, showcases dynamic element addition and deletion with keyboard shortcuts. The program handles integer inputs and provides informative pop-ups. Additionally, it offers a comprehensive view of the tree through inorder, preorder, and postorder traversal.

Notifications You must be signed in to change notification settings

takitajwar17/BinaryVision

Repository files navigation

BinaryVision: A BS-Tree-mendous Visualizer

maintainer jdk version release

Table of contents

Introduction

  • Hey there, welcome to BST Visualization repository. In this repository you see how operations in Binary Search Tree Data Structure like "Delete" and "Add" actually works and how BST is construct in visually.
  • Currently this program accept only Integer inputs.

Prerequisite

Download

Explanation

Adding Element in Binary Search Tree

  • We can add element in BST using two ways.
    1. With using "Add" button.
    2. With pressing "A" or "a" or "Enter" key in keyboard.

Add in BST

Deleting Element from Binary Search Tree

  • We can also delete element in BST using two ways.
    1. With using "Delete" button.
    2. With pressing "D" or "d" key in keyboard.

Delete in BST

  • If entered element is no present or Binary Search Tree is empty then it throws an popup window.

1. BST Empty Error

BST Empty Error

2. Element Not Available Error

Element Not Available Error

About

BinaryVision, a Java-based Binary Search Tree (BST) visualizer using Swing, showcases dynamic element addition and deletion with keyboard shortcuts. The program handles integer inputs and provides informative pop-ups. Additionally, it offers a comprehensive view of the tree through inorder, preorder, and postorder traversal.

Topics

Resources

Stars

Watchers

Forks

Languages