Skip to content
#

tree-structure

Here are 55 public repositories matching this topic...

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.

  • Updated Dec 16, 2022
  • Go

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 tree-structure 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-structure topic, visit your repo's landing page and select "manage topics."

Learn more