luke-else/Algorithms-DataStructures
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Reorganised Repo

Browse Source
This commit is contained in:
luke-else 2021-11-18 17:40:29 +00:00
parent 409a5fd884
commit c942ce57ce
19 changed files with 371 additions and 371 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

0
BinaryTree/BinaryTree/.vscode/launch.json → BinaryTree/.vscode/launch.json vendored
View File

0
BinaryTree/BinaryTree/.vscode/tasks.json → BinaryTree/.vscode/tasks.json vendored
View File

16
BinaryTree/BinaryTree/BinaryTree.csproj → BinaryTree/BinaryTree.csproj
View File

@ -1,8 +1,8 @@
<Project Sdk="Microsoft.NET.Sdk">
<PropertyGroup>
<OutputType>Exe</OutputType>
<TargetFramework>net5.0</TargetFramework>
</PropertyGroup>
</Project>
<Project Sdk="Microsoft.NET.Sdk">
<PropertyGroup>
<OutputType>Exe</OutputType>
<TargetFramework>net5.0</TargetFramework>
</PropertyGroup>
</Project>

62
BinaryTree/BinaryTree/Program.cs → BinaryTree/Program.cs
View File

@ -1,31 +1,31 @@
using System;
namespace BinaryTree
{
class Program
{
static void Main(string[] args)
{
tree tree = new tree();
Random random = new Random();
for (var i = 0; i < 35; i++)
{
tree.Add(random.Next(0, 100));
}
while (true)
{
Console.Clear();
tree.Print(tree.Root);
Console.WriteLine("-------------------------------------");
Console.WriteLine("Delete node: ");
tree.Delete(Convert.ToInt32(Console.ReadLine()));
}
}
}
}
using System;
namespace BinaryTree
{
class Program
{
static void Main(string[] args)
{
tree tree = new tree();
Random random = new Random();
for (var i = 0; i < 35; i++)
{
tree.Add(random.Next(0, 100));
}
while (true)
{
Console.Clear();
tree.Print(tree.Root);
Console.WriteLine("-------------------------------------");
Console.WriteLine("Delete node: ");
tree.Delete(Convert.ToInt32(Console.ReadLine()));
}
}
}
}

102
BinaryTree/BinaryTree/node.cs → BinaryTree/node.cs
View File

@ -1,52 +1,52 @@
namespace BinaryTree
{
public class node
{
public dynamic Data { get; set; }
private node Parent { get; set; }
private node Left { get; set; }
private node Right { get; set; }
//Print Method Data
public int StartPos;
public int Size { get { return Data.Length; } }
public int EndPos { get { return StartPos + Size; } set { StartPos = value - Size; } }
public node(dynamic _Data = null,
node _Parent = null,
node _Left = null,
node _Right = null){
//New node for a Binary Tree. Values can be set to null if they are not present
Data = _Data;
Parent = _Parent;
Left = _Left;
Right = _Right;
}
public node GetParent(){
return Parent;
}
public void SetParent(node _Parent){
Parent = _Parent;
}
public node GetLeft(){
return Left;
}
public void SetLeft(node _Left){
Left = _Left;
}
public node GetRight(){
return Right;
}
public void SetRight(node _Right){
Right = _Right;
}
}
namespace BinaryTree
{
public class node
{
public dynamic Data { get; set; }
private node Parent { get; set; }
private node Left { get; set; }
private node Right { get; set; }
//Print Method Data
public int StartPos;
public int Size { get { return Data.Length; } }
public int EndPos { get { return StartPos + Size; } set { StartPos = value - Size; } }
public node(dynamic _Data = null,
node _Parent = null,
node _Left = null,
node _Right = null){
//New node for a Binary Tree. Values can be set to null if they are not present
Data = _Data;
Parent = _Parent;
Left = _Left;
Right = _Right;
}
public node GetParent(){
return Parent;
}
public void SetParent(node _Parent){
Parent = _Parent;
}
public node GetLeft(){
return Left;
}
public void SetLeft(node _Left){
Left = _Left;
}
public node GetRight(){
return Right;
}
public void SetRight(node _Right){
Right = _Right;
}
}
}

558
BinaryTree/BinaryTree/tree.cs → BinaryTree/tree.cs
View File

@ -1,280 +1,280 @@
using System;
using System.Collections.Generic;
namespace BinaryTree
{
public class tree
{
public node Root { get; set; }
private node Current { get; set; }
public tree(dynamic _Data = null){
//New tree - Sets the Root of the tree to a new node
Root = new node(_Data);
}
public void Add(dynamic _Data){
//If the Root of the List is not set.
if (Root.Data == null)
{
Root.Data = _Data;
return;
}else{
Current = Root;
}
//traverse through the tree to the relevant point at which the item should be added
while(true){
var temp = Traverse(_Data, Current);
//If it is null, we are at a leaf node and we can stop traversing the tree
if (temp == null)
{
break;
}
Current = temp;
}
//Check whether we need to add the node to the left or right of
if (_Data < Current.Data)
{
Current.SetLeft(new node(_Data, Current));
}else{
Current.SetRight(new node(_Data, Current));
}
}
private node Traverse(dynamic _Data, node _Current){
//Check whether to branch to the right or the left in the tree.
if (_Data < _Current.Data)
{
return _Current.GetLeft();
}
return _Current.GetRight();
}
public bool Delete(dynamic _Data){
//Traverse to the node we are trying to delete
Current = Root;
//try statement will run unless the node does not exitst, in which case it will throw an exception and return false.
try
{
while(true){
if (_Data != Current.Data)
{
Current = Traverse(_Data, Current);
}else{
break;
}
}
}
catch
{
//If it can't be found, return false
return false;
}
if (Current.GetLeft() != null && Current.GetRight() != null)
{
//If it has 2 children
node temp = Current.GetLeft();
//Traverse to node that will replace Current
while(true){
if (temp.GetRight() != null)
{
temp = temp.GetRight();
}else{
break;
}
}
Current.Data = temp.Data;
//Find if the temp node is a left or a right node before deleting.
if(temp.GetParent() == Current){
//If the current node is parent to our replacing node. (Only 1 level down)
Current.SetLeft(temp.GetLeft());
if (temp.GetLeft() != null)
{
temp.GetLeft().SetParent(temp.GetParent());
}
}else{
//If we could traverse down the left hand side
if (temp.GetLeft() != null)
{
temp.GetParent().SetRight(temp.GetLeft());
temp.GetLeft().SetParent(temp.GetParent());
}else{
temp.GetParent().SetRight(null);
}
}
return true;
}else if(Current.GetLeft() != null || Current.GetRight() != null)
{
bool LeftFlag = false;
if (Current == Root)
{
if (Current.GetLeft() != null)
{
Root = Current.GetLeft();
}else{
Root = Current.GetRight();
}
return true;
}
if (Current.Data < Current.GetParent().Data)
{
LeftFlag = true;
}
if (Current.GetLeft() != null)
{//If it has a left child
if (LeftFlag == true)
{
Current.GetParent().SetLeft(Current.GetLeft());
}else{
Current.GetParent().SetRight(Current.GetLeft());
}
Current.GetLeft().SetParent(Current.GetParent());
}else{//If it has a right child
if (LeftFlag == true)
{
Current.GetParent().SetLeft(Current.GetRight());
}else{
Current.GetParent().SetRight(Current.GetRight());
}
Current.GetRight().SetParent(Current.GetParent());
}
return true;
}else{
//If it has no children
if (Current == Root)
{
Root = null;
return true;
}else{
//Set the parent's relevent pointer to null
if (Current.Data <= Current.GetParent().Data)
{
Current.GetParent().SetLeft(null);
return true;
}else{
Current.GetParent().SetRight(null);
return true;
}
}
}
}
//print Method functions
public void Print(node root, int topMargin = 2, int leftMargin = 2)
{
if (root == null) return;
int rootTop = Console.CursorTop + topMargin;
var last = new List<node>();
var next = root;
for (int level = 0; next != null; level++)
{
var item = new node { Data = next.Data.ToString(" 0 ") };
item.SetLeft(next.GetLeft());
item.SetRight(next.GetRight());
if (level < last.Count)
{
item.StartPos = last[level].EndPos + 1;
last[level] = item;
}
else
{
item.StartPos = leftMargin;
last.Add(item);
}
if (level > 0)
{
item.SetParent(last[level - 1]);
if (next == item.GetParent().GetLeft())
{
item.GetParent().SetLeft(item);
item.EndPos = Math.Max(item.EndPos, item.GetParent().StartPos);
}
else
{
item.GetParent().SetRight(item);
item.StartPos = Math.Max(item.StartPos, item.GetParent().EndPos);
}
}
next = next.GetLeft() ?? next.GetRight();
for (; next == null; item = item.GetParent())
{
Print(item, rootTop + 2 * level);
if (--level < 0) break;
if (item == item.GetParent().GetLeft())
{
item.GetParent().StartPos = item.EndPos;
next = item.GetParent().GetRight();
}
else
{
if (item.GetParent().GetLeft() == null)
item.GetParent().EndPos = item.StartPos;
else
item.GetParent().StartPos += (item.StartPos - item.GetParent().EndPos) / 2;
}
}
}
Console.SetCursorPosition(0, rootTop + 2 * last.Count - 1);
}
private void Print(node item, int top)
{
SwapColors();
Print(item.Data, top, item.StartPos);
SwapColors();
if (item.GetLeft() != null)
PrintLink(top + 1, "┌", "┘", item.GetLeft().StartPos + item.GetLeft().Size / 2, item.StartPos);
if (item.GetRight() != null)
PrintLink(top + 1, "└", "┐", item.EndPos - 1, item.GetRight().StartPos + item.GetRight().Size / 2);
}
private void PrintLink(int top, string start, string end, int startPos, int endPos)
{
Print(start, top, startPos);
Print("─", top, startPos + 1, endPos);
Print(end, top, endPos);
}
private void Print(string s, int top, int left, int right = -1)
{
Console.SetCursorPosition(left, top);
if (right < 0) right = left + s.Length;
while (Console.CursorLeft < right) Console.Write(s);
}
private void SwapColors()
{
var color = Console.ForegroundColor;
Console.ForegroundColor = Console.BackgroundColor;
Console.BackgroundColor = color;
}
}
using System;
using System.Collections.Generic;
namespace BinaryTree
{
public class tree
{
public node Root { get; set; }
private node Current { get; set; }
public tree(dynamic _Data = null){
//New tree - Sets the Root of the tree to a new node
Root = new node(_Data);
}
public void Add(dynamic _Data){
//If the Root of the List is not set.
if (Root.Data == null)
{
Root.Data = _Data;
return;
}else{
Current = Root;
}
//traverse through the tree to the relevant point at which the item should be added
while(true){
var temp = Traverse(_Data, Current);
//If it is null, we are at a leaf node and we can stop traversing the tree
if (temp == null)
{
break;
}
Current = temp;
}
//Check whether we need to add the node to the left or right of
if (_Data < Current.Data)
{
Current.SetLeft(new node(_Data, Current));
}else{
Current.SetRight(new node(_Data, Current));
}
}
private node Traverse(dynamic _Data, node _Current){
//Check whether to branch to the right or the left in the tree.
if (_Data < _Current.Data)
{
return _Current.GetLeft();
}
return _Current.GetRight();
}
public bool Delete(dynamic _Data){
//Traverse to the node we are trying to delete
Current = Root;
//try statement will run unless the node does not exitst, in which case it will throw an exception and return false.
try
{
while(true){
if (_Data != Current.Data)
{
Current = Traverse(_Data, Current);
}else{
break;
}
}
}
catch
{
//If it can't be found, return false
return false;
}
if (Current.GetLeft() != null && Current.GetRight() != null)
{
//If it has 2 children
node temp = Current.GetLeft();
//Traverse to node that will replace Current
while(true){
if (temp.GetRight() != null)
{
temp = temp.GetRight();
}else{
break;
}
}
Current.Data = temp.Data;
//Find if the temp node is a left or a right node before deleting.
if(temp.GetParent() == Current){
//If the current node is parent to our replacing node. (Only 1 level down)
Current.SetLeft(temp.GetLeft());
if (temp.GetLeft() != null)
{
temp.GetLeft().SetParent(temp.GetParent());
}
}else{
//If we could traverse down the left hand side
if (temp.GetLeft() != null)
{
temp.GetParent().SetRight(temp.GetLeft());
temp.GetLeft().SetParent(temp.GetParent());
}else{
temp.GetParent().SetRight(null);
}
}
return true;
}else if(Current.GetLeft() != null || Current.GetRight() != null)
{
bool LeftFlag = false;
if (Current == Root)
{
if (Current.GetLeft() != null)
{
Root = Current.GetLeft();
}else{
Root = Current.GetRight();
}
return true;
}
if (Current.Data < Current.GetParent().Data)
{
LeftFlag = true;
}
if (Current.GetLeft() != null)
{//If it has a left child
if (LeftFlag == true)
{
Current.GetParent().SetLeft(Current.GetLeft());
}else{
Current.GetParent().SetRight(Current.GetLeft());
}
Current.GetLeft().SetParent(Current.GetParent());
}else{//If it has a right child
if (LeftFlag == true)
{
Current.GetParent().SetLeft(Current.GetRight());
}else{
Current.GetParent().SetRight(Current.GetRight());
}
Current.GetRight().SetParent(Current.GetParent());
}
return true;
}else{
//If it has no children
if (Current == Root)
{
Root = null;
return true;
}else{
//Set the parent's relevent pointer to null
if (Current.Data <= Current.GetParent().Data)
{
Current.GetParent().SetLeft(null);
return true;
}else{
Current.GetParent().SetRight(null);
return true;
}
}
}
}
//print Method functions
public void Print(node root, int topMargin = 2, int leftMargin = 2)
{
if (root == null) return;
int rootTop = Console.CursorTop + topMargin;
var last = new List<node>();
var next = root;
for (int level = 0; next != null; level++)
{
var item = new node { Data = next.Data.ToString(" 0 ") };
item.SetLeft(next.GetLeft());
item.SetRight(next.GetRight());
if (level < last.Count)
{
item.StartPos = last[level].EndPos + 1;
last[level] = item;
}
else
{
item.StartPos = leftMargin;
last.Add(item);
}
if (level > 0)
{
item.SetParent(last[level - 1]);
if (next == item.GetParent().GetLeft())
{
item.GetParent().SetLeft(item);
item.EndPos = Math.Max(item.EndPos, item.GetParent().StartPos);
}
else
{
item.GetParent().SetRight(item);
item.StartPos = Math.Max(item.StartPos, item.GetParent().EndPos);
}
}
next = next.GetLeft() ?? next.GetRight();
for (; next == null; item = item.GetParent())
{
Print(item, rootTop + 2 * level);
if (--level < 0) break;
if (item == item.GetParent().GetLeft())
{
item.GetParent().StartPos = item.EndPos;
next = item.GetParent().GetRight();
}
else
{
if (item.GetParent().GetLeft() == null)
item.GetParent().EndPos = item.StartPos;
else
item.GetParent().StartPos += (item.StartPos - item.GetParent().EndPos) / 2;
}
}
}
Console.SetCursorPosition(0, rootTop + 2 * last.Count - 1);
}
private void Print(node item, int top)
{
SwapColors();
Print(item.Data, top, item.StartPos);
SwapColors();
if (item.GetLeft() != null)
PrintLink(top + 1, "┌", "┘", item.GetLeft().StartPos + item.GetLeft().Size / 2, item.StartPos);
if (item.GetRight() != null)
PrintLink(top + 1, "└", "┐", item.EndPos - 1, item.GetRight().StartPos + item.GetRight().Size / 2);
}
private void PrintLink(int top, string start, string end, int startPos, int endPos)
{
Print(start, top, startPos);
Print("─", top, startPos + 1, endPos);
Print(end, top, endPos);
}
private void Print(string s, int top, int left, int right = -1)
{
Console.SetCursorPosition(left, top);
if (right < 0) right = left + s.Length;
while (Console.CursorLeft < right) Console.Write(s);
}
private void SwapColors()
{
var color = Console.ForegroundColor;
Console.ForegroundColor = Console.BackgroundColor;
Console.BackgroundColor = color;
}
}
}

0
DoublyLinkedList/DoublyLinkedList/App.config → DoublyLinkedList/App.config
View File

0
DoublyLinkedList/DoublyLinkedList/DoublyLinkedList.csproj → DoublyLinkedList/DoublyLinkedList.csproj
View File

2
DoublyLinkedList/DoublyLinkedList.sln
View File

@ -3,7 +3,7 @@ Microsoft Visual Studio Solution File, Format Version 12.00
# Visual Studio Version 16
VisualStudioVersion = 16.0.31229.75
MinimumVisualStudioVersion = 10.0.40219.1
Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "DoublyLinkedList", "DoublyLinkedList\DoublyLinkedList.csproj", "{D7477EF3-B68D-47A5-BFA0-8FDD9354C99C}"
Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "DoublyLinkedList", "DoublyLinkedList.csproj", "{D7477EF3-B68D-47A5-BFA0-8FDD9354C99C}"
EndProject
Global
GlobalSection(SolutionConfigurationPlatforms) = preSolution

0
DoublyLinkedList/DoublyLinkedList/LinkedList.cs → DoublyLinkedList/LinkedList.cs
View File

0
DoublyLinkedList/DoublyLinkedList/Node.cs → DoublyLinkedList/Node.cs
View File

0
DoublyLinkedList/DoublyLinkedList/Program.cs → DoublyLinkedList/Program.cs
View File

0
DoublyLinkedList/DoublyLinkedList/Properties/AssemblyInfo.cs → DoublyLinkedList/Properties/AssemblyInfo.cs
View File

0
Prime Numbers (Efficient)/Prime Numbers (Efficient)/App.config → Prime Numbers (Efficient)/App.config
View File

0
Prime Numbers (Efficient)/Prime Numbers (Efficient)/Prime Numbers (Efficient).csproj → Prime Numbers (Efficient)/Prime Numbers (Efficient).csproj
View File

2
Prime Numbers (Efficient)/Prime Numbers (Efficient).sln
View File

@ -3,7 +3,7 @@ Microsoft Visual Studio Solution File, Format Version 12.00
# Visual Studio Version 16
VisualStudioVersion = 16.0.30320.27
MinimumVisualStudioVersion = 10.0.40219.1
Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "Prime Numbers (Efficient)", "Prime Numbers (Efficient)\Prime Numbers (Efficient).csproj", "{F438C480-1EEE-4010-A79D-BDFC1712EFBC}"
Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "Prime Numbers (Efficient)", "Prime Numbers (Efficient).csproj", "{F438C480-1EEE-4010-A79D-BDFC1712EFBC}"
EndProject
Global
GlobalSection(SolutionConfigurationPlatforms) = preSolution

0
Prime Numbers (Efficient)/Prime Numbers (Efficient)/Program.cs → Prime Numbers (Efficient)/Program.cs
View File

0
Prime Numbers (Efficient)/Prime Numbers (Efficient)/Properties/AssemblyInfo.cs → Prime Numbers (Efficient)/Properties/AssemblyInfo.cs
View File

0
Prime Numbers (Efficient)/Prime Numbers (Efficient)/prime.cs → Prime Numbers (Efficient)/prime.cs
View File