Skip to content
#

tree-data-structure

Here are 22 public repositories matching this topic...

🌲 A C++ implementation of all functionalities (insertion, deletion, search etc) of a 2-3 (two-three) Tree using Rotation, Split and Merge operations. (Please share if you find any bug in the code)

  • Updated Jan 17, 2021
  • C++

A Tree is a widely used abstract data type that simulates a hierarchical tree structure, with a root value and subtrees of children with a parent node, represented as a set of linked nodes. A Tree data structure can be defined recursively as a collection of nodes, where each node is a data structure consisting of a value and a list of references to nodes. The start of the tree is the "root node" and the reference nodes are the "children". No reference is duplicated and none points to the root.

  • Updated Dec 12, 2021
  • C++

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