Skip to content
#

bst

Here are 12 public repositories matching this topic...

This is a Go implementation of the BST data structure with a few of the most common operations. The algorithms code should be easy to understand. BST Tree is a binary tree in which the value of each node is greater than or equal to any value stored in the left sub-tree, and less than or equal to any value stored in the right sub-tree.

  • Updated Dec 26, 2022
  • Go

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