Skip to content
#

tree-data-structure

Here is 1 public repository 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

Improve this page

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

Learn more