Documentation
¶
Overview ¶
Package trees provides an abstract Tree interface.
In computer science, a tree is a widely used abstract data type (ADT) or data structure implementing this ADT 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.
Reference: https://en.wikipedia.org/wiki/Tree_%28data_structure%29
Index ¶
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type Tree ¶
type Tree[V any] interface { containers.Container[V] }
Tree interface that all trees implement
Source Files
Directories
¶
| Path | Synopsis |
|---|---|
|
Package avltree implements an AVL balanced binary tree.
|
Package avltree implements an AVL balanced binary tree. |
|
Package binaryheap implements a binary heap backed by array list.
|
Package binaryheap implements a binary heap backed by array list. |
|
Package btree implements a B tree.
|
Package btree implements a B tree. |
|
Package redblacktree implements a red-black tree.
|
Package redblacktree implements a red-black tree. |
Click to show internal directories.
Click to hide internal directories.