0xabdulkhalid / binary-search-trees

An interactive demonstration of Binary Search Tree operations.

Home Page:https://binary-search-trees.vercel.app

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool




Experience binary search trees in action with interactive demonstrations


❯   View Demo  ·  Report Bug  ·  Request Feature   ❮


Mobile Preview

Installation

Note

If you prefer not to install it locally, you can also access the live demo version

To set up the BST Application locally, follow these steps:

  1. Clone the GitHub repository to your local machine:

    git clone https://github.com/0xabdulkhalid/binary-search-trees.git
  2. Navigate to the project's directory:

    cd binary-search-trees
  3. Install the project's dependencies using npm:

    npm install
  4. Build the project to bundle JavaScript, minify HTML and CSS, and move images:

    npm run build
  5. The build files can be found on dist (distribution) directory.


Features

  • Create and Visualize BST: Easily create a binary search tree from an array and visualize its structure.

  • Interactive Operations: Insert, delete, and search for values within the tree, providing insights into how BSTs work.

  • Measure Tree Height: Calculate the height of the tree, an essential metric in tree analysis.

  • Determine Depth: Find the depth of a specific value in the tree to understand its position.

  • Check for Balance: Evaluate tree balance to optimize performance.

  • Tree Traversals: Explore different tree traversal algorithms, including level-order, pre-order, in-order, and post-order.

  • Seamless Theme Switching: Enjoy a light or dark theme at your convenience, and your preferred theme is automatically saved in local storage for a consistent experience across visits.

  • Optimized for Any Screen: Effortlessly adapt to screens of all sizes, ensuring a flawless experience on both desktop and mobile devices.

  • ES6 Modules: JavaScript code is organized into ES6 modules for improved maintainability.

  • Webpack Bundling: Optimize resource loading by bundling JavaScript modules with Webpack.

  • Cross-Browser Compatibility: Ensure smooth performance across various web browsers.

  • Code Formatting Guidelines: The project adheres to coding standards and maintains code consistency by implementing ESLint along with Prettier for code formatting.


Pagespeed Insights Score

  • Overall Score 98.6%, Average of Mobile and Desktop
    [ Mobile devices score is only shown below ]
    Scoreboard
    Check out Pagespeed Insights to get live score

Built With

HTML5   CSS3   JavaScript   Webpack   html-minifier   CSS3


Tools Used

NPM   Google   Prettier   Eslint   Visual Studio Code   Git   Figma


Let's Connect 👋

Linkedin Profile    mail/    Github Profile

About

An interactive demonstration of Binary Search Tree operations.

https://binary-search-trees.vercel.app

License:MIT License


Languages

Language:JavaScript 39.9%Language:CSS 34.1%Language:HTML 26.0%