Skip to content
#

tree-algorithms

Star

Here are 3 public repositories matching this topic...

Language: Go
Filter by language
All 48 C++ 10 Java 8 Python 8 C# 6 C 3 Go 3 Jupyter Notebook 3 JavaScript 2 MATLAB 1 Rust 1

BaseMax / BSTGo

Sponsor
Star 1

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.

go golang tree algorithm data-structure algorithms tree-structure tree-search bst datastructure algorithms-and-data-structures tree-algorithms tree-insert tree-algorithm tree-datastructure tere-data-structure
  • Updated Dec 26, 2022
  • Go

BaseMax / BinaryTreeGo

Sponsor
Star 0

Implementation of a binary tree in Go. A Binary Tree is a tree data structure in which each node has at most two children, which are referred to as the left child and the right child. A node with no children is called a leaf node. A node cannot have more than two children.

go golang tree algorithm data-structure algorithms binary-tree tree-structure tree-search datastructure algorithms-datastructures ds algorithms-and-data-structures tree-algorithms tree-data-structure tree-binary
  • Updated Dec 16, 2022
  • Go

Improve this page

Add a description, image, and links to the tree-algorithms 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 tree-algorithms topic, visit your repo's landing page and select "manage topics."

Learn more