Skip to content

alivia-23/BinarySearchTreeVisualizer

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

8 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Binary Search Tree Visualization Application

Key Features Implemented

  • Add and Delete operation in a BST
  • Calculates PreOrder, InOrder, PostOrder results
  • Calculates Height of the BST

Key Constraints

  • The left subtree of a root node should be always lesser than the root node
  • The right subtree of a root node should be always greater than the root node
  • The left and right subtree each must satisfy the property of binary search tree

Screenshot

BSTVisualScreenshot

Demo Video

BinarySearchTreeVisualImplementation

About

Build the Visual Implementation of Binary Search Tree(BST), addition and deletion of nodes, Pre-Order, Post-Order, In-Order and height calculated accordingly using tech-stack Java, Swing GUI

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors

Languages