trees

package
v1.8.0 Latest Latest
Warning

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

 Go to latest Published: Mar 5, 2017 License: BSD-2-Clause, ISC Imports: 1 Imported by: 271

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

Source Files

View all 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.

Jump to

Keyboard shortcuts

? : This menu
/ : Search site
f or F : Jump to
y or Y : Canonical URL
go.dev uses cookies from Google to deliver and enhance the quality of its services and to analyze traffic. Learn more.