Class BinarySearchTreeNode<T>

Namespace

Garyon.DataStructures.Trees

Assembly

Garyon.dll

Represents a tree node, which is a component that is contained within a tree.

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

Type Parameters

T

The type of the value that is stored in the node.

Inheritance

object

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

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

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

BinarySearchTreeNode<T>

Implements

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

ITreeNode<T>

IEnumerable<T>

IEnumerable

Inherited Members

BinarySearchTreeNode<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.Parent

BinarySearchTreeNode<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.Children

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

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

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

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

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

BinarySearchTreeNode<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.AddNodes(IEnumerable<T>)

BinarySearchTreeNode<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.AddNodes(IEnumerable<BinarySearchTreeNode<T>>)

BinarySearchTreeNode<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.AddNodes(params T[])

BinarySearchTreeNode<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.AddNodes(params BinarySearchTreeNode<T>[])

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

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

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

BinaryTreeNode<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.InternalLeftChild

BinaryTreeNode<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.InternalRightChild

BinaryTreeNode<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.LeftChild

BinaryTreeNode<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.RightChild

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

BinaryTreeNode<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.Parent

BinaryTreeNode<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.Children

BinaryTreeNode<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.ChildrenCount

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

BinaryTreeNode<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.GetChild(T)

BinaryTreeNode<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.AddChild(T)

BinaryTreeNode<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.AddChild(BinarySearchTreeNode<T>)

BinaryTreeNode<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.AddChildren(T, T)

BinaryTreeNode<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.AddChildren(BinarySearchTreeNode<T>, BinarySearchTreeNode<T>)

BinaryTreeNode<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.RegisterAddedChild(BinarySearchTreeNode<T>)

BinaryTreeNode<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.PerformChildRemoval(BinarySearchTreeNode<T>)

BinaryTreeNode<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.AddChildrenToClonedInstance(BinarySearchTreeNode<T>)

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

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

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

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

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

BinaryTreeNode<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.RemoveChildren(IEnumerable<BinarySearchTreeNode<T>>)

BinaryTreeNode<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.RemoveChildren(params BinarySearchTreeNode<T>[])

BinaryTreeNode<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.RemoveChildren(IEnumerable<T>)

BinaryTreeNode<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.RemoveChildren(params T[])

BaseTreeNode<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.InternalBaseTree

BaseTreeNode<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.InternalParent

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

BaseTreeNode<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.Value

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

BaseTreeNode<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.Parent

BaseTreeNode<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.Children

BaseTreeNode<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.ChildrenCount

BaseTreeNode<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.IsRoot

BaseTreeNode<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.IsLeaf

BaseTreeNode<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.BaseTreeHeight

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

BaseTreeNode<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.Depth

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

BaseTreeNode<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.Descendants

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

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

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

BaseTreeNode<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.GetChild(T)

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

BaseTreeNode<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.GetNode(IEnumerable<BinarySearchTreeNode<T>>, T)

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

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

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

BaseTreeNode<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.RemoveNodes(params T[])

BaseTreeNode<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.RemoveChild(BinarySearchTreeNode<T>)

BaseTreeNode<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.RemoveChild(T)

BaseTreeNode<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.RegisterAddedChild(BinarySearchTreeNode<T>)

BaseTreeNode<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.PerformChildRemoval(BinarySearchTreeNode<T>)

BaseTreeNode<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.MakeChildOf(BinarySearchTreeNode<T>)

BaseTreeNode<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.MakeParentOf(BinarySearchTreeNode<T>)

BaseTreeNode<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.Clone()

BaseTreeNode<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.Clone(bool)

BaseTreeNode<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.AddChildrenToClonedInstance(BinarySearchTreeNode<T>)

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

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

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

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

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

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

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

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

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

BaseTreeNode<T, BinarySearchTree<T>, BinarySearchTreeNode<T>>.ToString()

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)

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

BinarySearchTreeNode(BinarySearchTreeNode<T>, BinarySearchTreeNode<T>, BinarySearchTreeNode<T>, T)

Initializes a new instance of the BinarySearchTreeNode<T> class with a parent and children nodes. The base tree is considered to be that of the parent.

public BinarySearchTreeNode(BinarySearchTreeNode<T> parentNode, BinarySearchTreeNode<T> child1, BinarySearchTreeNode<T> child2, T value = default)

Parameters

parentNode BinarySearchTreeNode<T>

The parent node.

child1 BinarySearchTreeNode<T>

The first child node.

child2 BinarySearchTreeNode<T>

The second child node.

value T

The value of the node.

BinarySearchTreeNode(BinarySearchTreeNode<T>, T)

Initializes a new instance of the BinarySearchTreeNode<T> class with a parent node, but no children nodes. The base tree is considered to be that of the parent.

public BinarySearchTreeNode(BinarySearchTreeNode<T> parentNode, T value = default)

Parameters

parentNode BinarySearchTreeNode<T>

The parent node.

value T

The value of the node.

BinarySearchTreeNode(BinarySearchTree<T>, T)

Initializes a new instance of the BinarySearchTreeNode<T> class with a base tree, but no parent or children nodes.

public BinarySearchTreeNode(BinarySearchTree<T> baseTree, T value = default)

Parameters

baseTree BinarySearchTree<T>

The base tree that contains this node.

value T

The value of the node.

BinarySearchTreeNode(T)

Initializes a new instance of the BinarySearchTreeNode<T> class with no base tree, parent or children nodes.

public BinarySearchTreeNode(T value = default)

Parameters

value T

The value of the 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>