Class BinaryTree<T>
A binary tree implementation using pointers.
Inheritance
BinaryTree<T>
Assembly: Advanced.Algorithms.dll
Syntax
public class BinaryTree<T> : IEnumerable<T> where T : IComparable
Type Parameters
Properties
Count
Declaration
public int Count { get; }
Property Value
Methods
Children(T)
Declaration
public IEnumerable<T> Children(T value)
Parameters
Type |
Name |
Description |
T |
value |
|
Returns
Type |
Description |
IEnumerable<T> |
|
Delete(T)
Only deletes unambiguous nodes (a node with two children cannot be deleted unambiguously).
Time complexity: O(n)
Declaration
public void Delete(T value)
Parameters
Type |
Name |
Description |
T |
value |
|
GetEnumerator()
Declaration
public IEnumerator<T> GetEnumerator()
Returns
Type |
Description |
IEnumerator<T> |
|
GetHeight()
Declaration
Returns
HasItem(T)
Declaration
public bool HasItem(T value)
Parameters
Type |
Name |
Description |
T |
value |
|
Returns
Insert(T, T)
Declaration
public void Insert(T parent, T child)
Parameters
Type |
Name |
Description |
T |
parent |
|
T |
child |
|