luke-else/DataStructuresCSharp
1
0
Fork 0
Code Issues 6 Pull Requests Projects 1 Releases Wiki Activity

Updated Tree to ensure no null values are added (Incomparable) and updated descend function to use traverse

Browse Source
This commit is contained in:
Luke Else 2022-04-13 21:17:33 +01:00
parent 9fab683f85
commit 31888a1529
2 changed files with 10 additions and 22 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

16
C#/Datastructures/BinarySearchTree/Tree.cs
View File

@ -16,7 +16,7 @@ namespace C_.Datastructures.BinarySearchTree
}; };
} }
public static Tree<T> Create(T? value){ public static Tree<T> Create(T value){
//Create a new Tree with Head //Create a new Tree with Head
return new Tree<T>{ return new Tree<T>{
Root = TreeNode<T>.Create(value) Root = TreeNode<T>.Create(value)
@ -85,18 +85,7 @@ namespace C_.Datastructures.BinarySearchTree
TreeNode<T>? node; TreeNode<T>? node;
if (value.CompareTo(current.Value) < 0) node = Descend(value, Traverse(value, current));
{//Descend left
node = Descend(value, current.Left);
if (node == null)
{
return current;
}
return node;
}
else
{//Descend right
node = Descend(value, current.Right);
if (node == null) if (node == null)
{ {
return current; return current;
@ -105,4 +94,3 @@ namespace C_.Datastructures.BinarySearchTree
} }
} }
} }
}

4
C#/Datastructures/BinarySearchTree/TreeNode.cs
View File

@ -9,14 +9,14 @@ namespace C_.Datastructures.BinarySearchTree
internal class TreeNode<T> : DirectedNode<T, TreeNode<T>> internal class TreeNode<T> : DirectedNode<T, TreeNode<T>>
{ {
//All properties inherited from base class //All properties inherited from base class
public static TreeNode<T> Create(T? value){ public static TreeNode<T> Create(T value){
//Create a new node without any children //Create a new node without any children
return new TreeNode<T>{ return new TreeNode<T>{
Value = value Value = value
}; };
} }
public static TreeNode<T> Create(T? value, TreeNode<T>? left, TreeNode<T>? right){ public static TreeNode<T> Create(T value, TreeNode<T>? left, TreeNode<T>? right){
//Create a new node with the option of having children //Create a new node with the option of having children
return new TreeNode<T>{ return new TreeNode<T>{
Value = value, Value = value,