trees

package
v1.5.2 Latest Latest
Warning

This package is not in the latest version of its module.

Go to latest
Published: Sep 7, 2016 License: BSD-2-Clause Imports: 1 Imported by: 0

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 interface {
	containers.Container
}

Tree interface that all trees implement

Directories

Path Synopsis
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.

Jump to

Keyboard shortcuts

? : This menu
/ : Search site
f or F : Jump to
y or Y : Canonical URL