Class BinarySearchTree<TValue, TTree, TTreeNode>

Namespace

Garyon.DataStructures.Trees

Assembly

Garyon.dll

Represents a tree.

public abstract class BinarySearchTree<TValue, TTree, TTreeNode> : BinaryTree<TValue, TTree, TTreeNode>, ITree<TValue, TTree, TTreeNode>, ITree<TValue>, ICollection<TValue>, IEnumerable<TValue>, IEnumerable where TValue : IComparable<TValue> where TTree : BinarySearchTree<TValue, TTree, TTreeNode> where TTreeNode : BinarySearchTreeNode<TValue, TTree, TTreeNode>

Type Parameters

TValue

The type of the elements the tree nodes store.

TTree

The type of the tree that this type is used in.

TTreeNode

The type of the tree nodes that are used in the TTree type.

Inheritance

object

BaseTree<TValue, TTree, TTreeNode>

BinaryTree<TValue, TTree, TTreeNode>

BinarySearchTree<TValue, TTree, TTreeNode>

Implements

ITree<TValue, TTree, TTreeNode>

ITree<TValue>

ICollection<TValue>

IEnumerable<TValue>

IEnumerable

Derived

BinarySearchTree<T>

Inherited Members

BinaryTree<TValue, TTree, TTreeNode>.SetChildren(TValue, TTreeNode, TTreeNode, bool)

BinaryTree<TValue, TTree, TTreeNode>.SetChildren(TTreeNode, TTreeNode, TTreeNode, bool)

BinaryTree<TValue, TTree, TTreeNode>.AddChild(TTreeNode, TValue, bool)

BinaryTree<TValue, TTree, TTreeNode>.AddChild(TTreeNode, TTreeNode, bool)

BinaryTree<TValue, TTree, TTreeNode>.AddChildren(TTreeNode, TTreeNode, TTreeNode, bool)

BinaryTree<TValue, TTree, TTreeNode>.RemoveRootChildren(IEnumerable<TValue>, bool)

BinaryTree<TValue, TTree, TTreeNode>.RemoveRootChildren(IEnumerable<TTreeNode>, bool)

BinaryTree<TValue, TTree, TTreeNode>.RemoveChildren(TValue, IEnumerable<TTreeNode>, bool)

BinaryTree<TValue, TTree, TTreeNode>.RemoveChildren(TValue, IEnumerable<TValue>, bool)

BinaryTree<TValue, TTree, TTreeNode>.RemoveChildren(TTreeNode, IEnumerable<TValue>, bool)

BinaryTree<TValue, TTree, TTreeNode>.RemoveChildren(TTreeNode, IEnumerable<TTreeNode>, bool)

BinaryTree<TValue, TTree, TTreeNode>.ClearChildren(TTreeNode, bool)

BinaryTree<TValue, TTree, TTreeNode>.TraverseInOrder()

BinaryTree<TValue, TTree, TTreeNode>.TraverseInOrderNodes()

BaseTree<TValue, TTree, TTreeNode>.CachedCount

BaseTree<TValue, TTree, TTreeNode>.InternalRoot

BaseTree<TValue, TTree, TTreeNode>.This

BaseTree<TValue, TTree, TTreeNode>.Root

BaseTree<TValue, TTree, TTreeNode>.Count

BaseTree<TValue, TTree, TTreeNode>.Height

BaseTree<TValue, TTree, TTreeNode>.Breadth

BaseTree<TValue, TTree, TTreeNode>.InitializeNewNode(TValue)

BaseTree<TValue, TTree, TTreeNode>.InitializeNewNode(TTree, TValue)

BaseTree<TValue, TTree, TTreeNode>.InitializeNewNode(TTreeNode, TValue)

BaseTree<TValue, TTree, TTreeNode>.Contains(TValue)

BaseTree<TValue, TTree, TTreeNode>.GetNode(TValue)

BaseTree<TValue, TTree, TTreeNode>.RemoveNode(TValue, bool)

BaseTree<TValue, TTree, TTreeNode>.RemoveNode(TValue)

BaseTree<TValue, TTree, TTreeNode>.RemoveNode(TTreeNode, bool)

BaseTree<TValue, TTree, TTreeNode>.RemoveNode(TTreeNode)

BaseTree<TValue, TTree, TTreeNode>.RemoveNodes(IEnumerable<TValue>)

BaseTree<TValue, TTree, TTreeNode>.RemoveNodes(TTreeNode, IEnumerable<TValue>)

BaseTree<TValue, TTree, TTreeNode>.RemoveChild(TTreeNode, TTreeNode, bool)

BaseTree<TValue, TTree, TTreeNode>.Remove(TValue)

BaseTree<TValue, TTree, TTreeNode>.ClearChildren(TValue, bool)

BaseTree<TValue, TTree, TTreeNode>.ClearChildren(TValue)

BaseTree<TValue, TTree, TTreeNode>.ClearChildren(TTreeNode, bool)

BaseTree<TValue, TTree, TTreeNode>.ClearChildren(TTreeNode)

BaseTree<TValue, TTree, TTreeNode>.Clear()

BaseTree<TValue, TTree, TTreeNode>.PrepareChildrenAdjustmentOperation(TTreeNode)

BaseTree<TValue, TTree, TTreeNode>.TraversePreOrder()

BaseTree<TValue, TTree, TTreeNode>.TraversePostOrder()

BaseTree<TValue, TTree, TTreeNode>.TraverseLevelOrder()

BaseTree<TValue, TTree, TTreeNode>.TraversePreOrderNodes()

BaseTree<TValue, TTree, TTreeNode>.TraversePostOrderNodes()

BaseTree<TValue, TTree, TTreeNode>.TraverseLevelOrderNodes()

BaseTree<TValue, TTree, TTreeNode>.GetTreeView(int)

BaseTree<TValue, TTree, TTreeNode>.GetEnumerator()

BaseTree<TValue, TTree, TTreeNode>.Equals(TTree)

BaseTree<TValue, TTree, TTreeNode>.Equals(object)

BaseTree<TValue, TTree, TTreeNode>.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<TValue, TTree, TTreeNode> class with no root node.

protected BinarySearchTree()

BinarySearchTree(TValue)

Initializes a new instance of the BinarySearchTree<TValue, TTree, TTreeNode> class with a root value.

protected BinarySearchTree(TValue rootValue)

Parameters

rootValue TValue

The value of the root node.

BinarySearchTree(TTree)

Initializes a new instance of the BinarySearchTree<TValue, TTree, TTreeNode> class from a different tree.

protected BinarySearchTree(TTree tree)

Parameters

tree TTree

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

BinarySearchTree(TTreeNode)

Initializes a new instance of the BinarySearchTree<TValue, TTree, TTreeNode> class with a root node.

protected BinarySearchTree(TTreeNode root)

Parameters

root TTreeNode

The root node.

Methods

Find(TValue)

Attempts to find a node with the specified value within this tree.

public TTreeNode Find(TValue value)

Parameters

value TValue

The value of the node to be found.

Returns

TTreeNode

The node within this tree that has the specified value, if found, otherwise null.