Topic: "tree-binary"
BaseMax/BinaryTreeGo
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.
Language: Go - Size: 36.1 KB - Last synced at: 17 days ago - Pushed at: almost 3 years ago - Stars: 1 - Forks: 0
cherrycita-dev/Algorithms-and-Data-Structures
Algorithms and Data Structures
Language: C - Size: 1.21 MB - Last synced at: 4 months ago - Pushed at: 10 months ago - Stars: 0 - Forks: 0
