README
¶
References
Documentation
¶
Overview ¶
Package dfs provides functions to perform a traverse using the depth-first search algorithm.
Index ¶
- func BinarySearchTreeLNR[T constraints.Ordered](bts *binarysearchtree.BinarySearchTree[T], cb func(v T) bool)
- func BinarySearchTreeLRN[T constraints.Ordered](bts *binarysearchtree.BinarySearchTree[T], cb func(v T) bool)
- func BinarySearchTreeNLR[T constraints.Ordered](bts *binarysearchtree.BinarySearchTree[T], cb func(v T) bool)
- func BinarySearchTreeRNL[T constraints.Ordered](bts *binarysearchtree.BinarySearchTree[T], cb func(v T) bool)
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
func BinarySearchTreeLNR ¶
func BinarySearchTreeLNR[T constraints.Ordered](bts *binarysearchtree.BinarySearchTree[T], cb func(v T) bool)
BinarySearchTreeLNR performs a traverse using the depth-first search algorithm with an in-order strategy in a binary search tree of an ordered type T.
func BinarySearchTreeLRN ¶
func BinarySearchTreeLRN[T constraints.Ordered](bts *binarysearchtree.BinarySearchTree[T], cb func(v T) bool)
BinarySearchTreeLRN performs a traverse using the depth-first search algorithm with a post-order strategy in a binary search tree of an ordered type T.
func BinarySearchTreeNLR ¶
func BinarySearchTreeNLR[T constraints.Ordered](bts *binarysearchtree.BinarySearchTree[T], cb func(v T) bool)
BinarySearchTreeNLR performs a traverse using the depth-first search algorithm with a pre-order strategy in a binary search tree of an ordered type T.
func BinarySearchTreeRNL ¶
func BinarySearchTreeRNL[T constraints.Ordered](bts *binarysearchtree.BinarySearchTree[T], cb func(v T) bool)
BinarySearchTreeRNL performs a traverse using the depth-first search algorithm with an out-order strategy in a binary search tree of an ordered type T.
Types ¶
This section is empty.
Source Files