Data

Tools

Indexes

Applications

Experiments

Repos

An open API service providing repository metadata for many open source software ecosystems.

GitHub topics: tere-data-structure

BaseMax/BSTGo

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.

Language: Go - Size: 29.3 KB - Last synced at: about 3 hours ago - Pushed at: over 2 years ago - Stars: 1 - Forks: 0

Related Keywords
algorithm 1 algorithms 1 algorithms-and-data-structures 1 bst 1 data-structure 1 datastructure 1 go 1 golang 1 tere-data-structure 1 tree 1 tree-algorithm 1 tree-algorithms 1 tree-datastructure 1 tree-insert 1 tree-search 1 tree-structure 1