Skip to content
#

bst

Here are 113 public repositories matching this topic...

🌳 This repository is dedicated to the Binary Search Tree (BST) data structure, featuring a comprehensive demo of all its functionalities including insertion, deletion, search, and traversal operations. It serves as an educational resource for understanding BSTs in depth, offering code examples and explanations suitable for students and developers.

  • Updated Jan 5, 2026
  • Java

Java Data Structures Lab – Binary Search Trees Module: Explore building, traversing, and manipulating BSTs in Java, including insertion, search, deletion (with inorder successor/predecessor), and student activities for validating, finding min/max, counting nodes in range, and converting sorted arrays to BST.

  • Updated Jan 17, 2026
  • Java

Java Data Structures Lab – Binary Trees Module: Learn to build, traverse, and analyze binary trees in Java, including preorder, inorder, postorder, level-order traversals, tree height, height-balanced checks, and LCA, with step-by-step examples and student activities.

  • Updated Jan 6, 2026
  • Java

Improve this page

Add a description, image, and links to the bst topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the bst topic, visit your repo's landing page and select "manage topics."

Learn more