Class BinarySearchTree<T>

Namespace

Garyon.DataStructures.Trees

Assembly

Garyon.dll

Represents a tree.

public class BinarySearchTree<T> : BinarySearchTree<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>, ITree<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>, ITree<T>, ICollection<T>, IEnumerable<T>, IEnumerable where T : IComparable<T>

Type Parameters

T

The type of the elements the tree nodes store.

Inheritance

object

BaseTree<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>

BinaryTree<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>

BinarySearchTree<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>

BinarySearchTree<T>

Implements

ITree<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>

ITree<T>

ICollection<T>

IEnumerable<T>

IEnumerable

Inherited Members

BinarySearchTree<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.Find(T)

BinaryTree<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.SetChildren(T, BinarySearchTreeNode<T>, BinarySearchTreeNode<T>, bool)

BinaryTree<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.SetChildren(BinarySearchTreeNode<T>, BinarySearchTreeNode<T>, BinarySearchTreeNode<T>, bool)

BinaryTree<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.AddChild(BinarySearchTreeNode<T>, T, bool)

BinaryTree<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.AddChild(BinarySearchTreeNode<T>, BinarySearchTreeNode<T>, bool)

BinaryTree<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.AddChildren(BinarySearchTreeNode<T>, BinarySearchTreeNode<T>, BinarySearchTreeNode<T>, bool)

BinaryTree<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.RemoveRootChildren(IEnumerable<T>, bool)

BinaryTree<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.RemoveRootChildren(IEnumerable<BinarySearchTreeNode<T>>, bool)

BinaryTree<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.RemoveChildren(T, IEnumerable<BinarySearchTreeNode<T>>, bool)

BinaryTree<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.RemoveChildren(T, IEnumerable<T>, bool)

BinaryTree<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.RemoveChildren(BinarySearchTreeNode<T>, IEnumerable<T>, bool)

BinaryTree<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.RemoveChildren(BinarySearchTreeNode<T>, IEnumerable<BinarySearchTreeNode<T>>, bool)

BinaryTree<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.ClearChildren(BinarySearchTreeNode<T>, bool)

BinaryTree<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.TraverseInOrder()

BinaryTree<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.TraverseInOrderNodes()

BaseTree<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.CachedCount

BaseTree<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.InternalRoot

BaseTree<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.This

BaseTree<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.Root

BaseTree<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.Count

BaseTree<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.Height

BaseTree<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.Breadth

BaseTree<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.InitializeNewNode(T)

BaseTree<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.InitializeNewNode(BinarySearchTree<T>, T)

BaseTree<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.InitializeNewNode(BinarySearchTreeNode<T>, T)

BaseTree<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.Contains(T)

BaseTree<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.GetNode(T)

BaseTree<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.RemoveNode(T, bool)

BaseTree<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.RemoveNode(T)

BaseTree<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.RemoveNode(BinarySearchTreeNode<T>, bool)

BaseTree<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.RemoveNode(BinarySearchTreeNode<T>)

BaseTree<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.RemoveNodes(IEnumerable<T>)

BaseTree<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.RemoveNodes(BinarySearchTreeNode<T>, IEnumerable<T>)

BaseTree<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.RemoveChild(BinarySearchTreeNode<T>, BinarySearchTreeNode<T>, bool)

BaseTree<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.Remove(T)

BaseTree<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.ClearChildren(T, bool)

BaseTree<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.ClearChildren(T)

BaseTree<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.ClearChildren(BinarySearchTreeNode<T>, bool)

BaseTree<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.ClearChildren(BinarySearchTreeNode<T>)

BaseTree<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.Clear()

BaseTree<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.PrepareChildrenAdjustmentOperation(BinarySearchTreeNode<T>)

BaseTree<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.TraversePreOrder()

BaseTree<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.TraversePostOrder()

BaseTree<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.TraverseLevelOrder()

BaseTree<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.TraversePreOrderNodes()

BaseTree<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.TraversePostOrderNodes()

BaseTree<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.TraverseLevelOrderNodes()

BaseTree<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.GetTreeView(int)

BaseTree<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.GetEnumerator()

BaseTree<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.Equals(BinarySearchTree<T>)

BaseTree<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.Equals(object)

BaseTree<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.GetHashCode()

object.Equals(object)

object.Equals(object, object)

object.GetHashCode()

object.GetType()

object.MemberwiseClone()

object.ReferenceEquals(object, object)

object.ToString()

Extension Methods

ComparisonExtensions.BeginCompare<T>(T, T)

IEnumeratorExtensions.GetEnumerator<TEnumerator, TValue>(TEnumerator)

MoreLinqExtensions.Apply<TSource>(TSource, Action<TSource>)

MoreLinqExtensions.Apply<TSource, TResult>(TSource, Func<TSource, TResult>)

SingleValueEnumeratorExtensions.EnumerateSingle<T>(T)

UpcastingCollectionExtensions.UpcastCollection<TBase, TUp>(ICollection<TBase>)

EarlyTerminatingLinqExtensions.CutAt<T>(IEnumerable<T>, Predicate<T>, bool)

EnumerableCartesianProducts.CartesianProduct<T>(IEnumerable<T>)

EnumerableExtremumExtensions.Extremum<T>(IEnumerable<T>, Extremum)

EnumerableExtremumExtensions.Extremum<T>(IEnumerable<T>, Extremum, Func<T, decimal>)

EnumerableExtremumExtensions.Extremum<T>(IEnumerable<T>, Extremum, Func<T, double>)

EnumerableExtremumExtensions.Extremum<T>(IEnumerable<T>, Extremum, Func<T, int>)

EnumerableExtremumExtensions.Extremum<T>(IEnumerable<T>, Extremum, Func<T, long>)

EnumerableExtremumExtensions.Extremum<T>(IEnumerable<T>, Extremum, Func<T, decimal?>)

EnumerableExtremumExtensions.Extremum<T>(IEnumerable<T>, Extremum, Func<T, double?>)

EnumerableExtremumExtensions.Extremum<T>(IEnumerable<T>, Extremum, Func<T, int?>)

EnumerableExtremumExtensions.Extremum<T>(IEnumerable<T>, Extremum, Func<T, long?>)

EnumerableExtremumExtensions.Extremum<T>(IEnumerable<T>, Extremum, Func<T, float?>)

EnumerableExtremumExtensions.Extremum<T>(IEnumerable<T>, Extremum, Func<T, float>)

EnumerableExtremumExtensions.Extremum<TSource, TResult>(IEnumerable<TSource>, Extremum, Func<TSource, TResult?>)

IEnumerableExtensions.ConcatMultiple<T>(IEnumerable<T>, params IEnumerable<IEnumerable<T>>)

IEnumerableExtensions.ConcatMultiple<T>(IEnumerable<T>, params IEnumerable<T>[])

IEnumerableExtensions.ConcatMultiple<T>(IEnumerable<T>, params ReadOnlySpan<IEnumerable<T>>)

IEnumerableExtensions.EqualsUnordered<T>(IEnumerable<T>, IEnumerable<T>)

MoreLinqExtensions.CountAtLeast<T>(IEnumerable<T>, Func<T, bool>, int)

MoreLinqExtensions.CountAtLeast<T>(IEnumerable<T>, int)

MoreLinqExtensions.CountAtMost<T>(IEnumerable<T>, Func<T, bool>, int)

MoreLinqExtensions.CountAtMost<T>(IEnumerable<T>, int)

MoreLinqExtensions.CountBetween<T>(IEnumerable<T>, Func<T, bool>, int, int)

MoreLinqExtensions.CountBetween<T>(IEnumerable<T>, int, int)

MoreLinqExtensions.CountExactly<T>(IEnumerable<T>, Func<T, bool>, int)

MoreLinqExtensions.CountExactly<T>(IEnumerable<T>, int)

MoreLinqExtensions.EnumeratePerformAction<T>(IEnumerable<T>, Action<T>?, Action<T>?, Action<T>)

MoreLinqExtensions.NotNullCount<T>(IEnumerable<T>)

MoreLinqExtensions.NullCount<T>(IEnumerable<T>)

MoreLinqExtensions.OnlyOrDefault<T>(IEnumerable<T>?)

MoreLinqExtensions.SelectOrDefault<TSource, TResult>(IEnumerable<TSource>, Func<TSource, TResult>?)

MoreLinqExtensions.WhereNotNull<T>(IEnumerable<T?>)

MoreLinqExtensions.WhereNot<T>(IEnumerable<T>, Func<T, bool>)

MoreLinqExtensions.WhereOrSource<T>(IEnumerable<T>, Func<T, bool>?)

MoreLinqExtensions.WherePredicate<T>(IEnumerable<T>, Predicate<T>)

MoreLinqExtensions.Zip<TA, TB>(IEnumerable<TA>, IEnumerable<TB>)

PendingLinqExtensions.Sum<TSource>(IEnumerable<TSource>, Func<TSource, uint?>)

PendingLinqExtensions.Sum<TSource>(IEnumerable<TSource>, Func<TSource, ulong?>)

PendingLinqExtensions.Sum<TSource>(IEnumerable<TSource>, Func<TSource, uint>)

PendingLinqExtensions.Sum<TSource>(IEnumerable<TSource>, Func<TSource, ulong>)

ToCollectionExtensions.ToArrayOrEmpty<T>(IEnumerable<T>?)

ToCollectionExtensions.ToArrayOrExisting<T>(IEnumerable<T>)

ToCollectionExtensions.ToCollectionOrExisting<T>(IEnumerable<T>)

ToCollectionExtensions.ToHashSetOrEmpty<T>(IEnumerable<T>?)

ToCollectionExtensions.ToHashSetOrExisting<T>(IEnumerable<T>)

ToCollectionExtensions.ToListOrEmpty<T>(IEnumerable<T>?)

ToCollectionExtensions.ToListOrExisting<T>(IEnumerable<T>)

ToCollectionExtensions.ToReadOnlyCollectionOrExisting<T>(IEnumerable<T>)

ToCollectionExtensions.ToReadOnlyListOrExisting<T>(IEnumerable<T>)

ToCollectionExtensions.ToReadOnlySetOrExisting<T>(IEnumerable<T>)

ToCollectionExtensions.ToSetOrExisting<T>(IEnumerable<T>)

ToCollectionExtensions.ToSortedSetOrEmpty<T>(IEnumerable<T>?)

ToCollectionExtensions.ToSortedSet<T>(IEnumerable<T>)

AffixedEnumerableExtensions.WithPrefix<T>(IEnumerable<T>, IEnumerable<T>)

AffixedEnumerableExtensions.WithPrefix<T>(IEnumerable<T>, T)

AffixedEnumerableExtensions.WithPrefix<T>(IEnumerable<T>, params T[])

AffixedEnumerableExtensions.WithSuffix<T>(IEnumerable<T>, IEnumerable<T>)

AffixedEnumerableExtensions.WithSuffix<T>(IEnumerable<T>, T)

AffixedEnumerableExtensions.WithSuffix<T>(IEnumerable<T>, params T[])

IEnumerableExtensions.EqualsUnordered(IEnumerable, IEnumerable)

Constructors

BinarySearchTree()

Initializes a new instance of the BinarySearchTree<T> class with no root node.

public BinarySearchTree()

BinarySearchTree(BinarySearchTreeNode<T>)

Initializes a new instance of the BinarySearchTree<T> class with a root node.

public BinarySearchTree(BinarySearchTreeNode<T> root)

Parameters

root BinarySearchTreeNode<T>

The root node.

BinarySearchTree(BinarySearchTree<T>)

Initializes a new instance of the BinarySearchTree<T> class from a different tree.

public BinarySearchTree(BinarySearchTree<T> tree)

Parameters

tree BinarySearchTree<T>

The tree to create this tree from. Both trees remain independent.

BinarySearchTree(T)

Initializes a new instance of the BinarySearchTree<T> class with a root value.

public BinarySearchTree(T rootValue)

Parameters

rootValue T

The value of the root node.

Methods

InitializeNewNode(BinarySearchTreeNode<T>, T)

Initializes a new instance of the TreeNode<T> class with a parent node. The base tree is considered to be that of the parent.

protected override BinarySearchTreeNode<T> InitializeNewNode(BinarySearchTreeNode<T> parentNode, T value = default)

Parameters

parentNode BinarySearchTreeNode<T>

The parent node.

value T

The value of the node.

Returns

BinarySearchTreeNode<T>

InitializeNewNode(BinarySearchTree<T>, T)

Initializes a new instance of the TreeNode<T> class with a base tree, but no parent node.

protected override BinarySearchTreeNode<T> InitializeNewNode(BinarySearchTree<T> baseTree, T value = default)

Parameters

baseTree BinarySearchTree<T>

The base tree that contains this node.

value T

The value of the node.

Returns

BinarySearchTreeNode<T>

InitializeNewNode(T)

Initializes a new instance of the TreeNode<T> class with no base tree or parent node.

protected override BinarySearchTreeNode<T> InitializeNewNode(T value = default)

Parameters

value T

The value of the node.

Returns

BinarySearchTreeNode<T>