From c7ccd641c48e4ac6e0d1eb7bb67a3b9ba2618250 Mon Sep 17 00:00:00 2001
From: Luke Else <mail@luke-else.co.uk>
Date: Tue, 19 Apr 2022 22:00:24 +0100
Subject: [PATCH] Cleaned up various DataStructures

---
 C#/Datastructures/BinaryTree/Tree.cs       |  8 +++-----
 C#/Datastructures/LinkedList/LinkedList.cs | 14 --------------
 2 files changed, 3 insertions(+), 19 deletions(-)

diff --git a/C#/Datastructures/BinaryTree/Tree.cs b/C#/Datastructures/BinaryTree/Tree.cs
index 5219063..7314667 100644
--- a/C#/Datastructures/BinaryTree/Tree.cs
+++ b/C#/Datastructures/BinaryTree/Tree.cs
@@ -196,7 +196,7 @@ namespace C_.Datastructures.BinaryTree
 
 
 
-        private TreeNode<T>? GetNext(T value, TreeNode<T>? node)
+        private static TreeNode<T>? GetNext(T value, TreeNode<T>? node)
         {//T is comparable so use methods to determine which way to traverse
             if(node == default)
                 return default;
@@ -214,8 +214,6 @@ namespace C_.Datastructures.BinaryTree
             if (Root == default || Root.Value!.Equals(default))
                 return default;
 
-            TreeNode<T>? current = Root;
-
             Stack<TreeNode<T>>? stack = Stack<TreeNode<T>>.Create(Root);
 
             while (stack.Peek() != default)
@@ -229,7 +227,7 @@ namespace C_.Datastructures.BinaryTree
             return default;
         }
 
-        private Stack<TreeNode<T>>? Min(TreeNode<T>? node)
+        private static Stack<TreeNode<T>>? Min(TreeNode<T>? node)
         {//Returns a Stack with the value on top being the minimum of the subtree
             
             if(node == default)
@@ -246,7 +244,7 @@ namespace C_.Datastructures.BinaryTree
             }
         }
 
-        private Stack<TreeNode<T>>? Max(TreeNode<T>? node)
+        private static Stack<TreeNode<T>>? Max(TreeNode<T>? node)
         {///Returns a Stack with the value on top being the maximum of the subtree
             if(node == default)
                 return default;
diff --git a/C#/Datastructures/LinkedList/LinkedList.cs b/C#/Datastructures/LinkedList/LinkedList.cs
index 9820811..9be1828 100644
--- a/C#/Datastructures/LinkedList/LinkedList.cs
+++ b/C#/Datastructures/LinkedList/LinkedList.cs
@@ -142,20 +142,6 @@ namespace C_.Datastructures.LinkedList
             return node;
         }
 
-        //private static LinkedListNode<T>? Traverse(LinkedListNode<T> start){
-        //    //Start at given point in list
-        //    LinkedListNode<T>? node = start;
-        //    if (node != null)
-        //    {
-        //        //Continue to end of list
-        //        while (node!.Next != default)
-        //        {
-        //            node = (LinkedListNode<T>)node.Next;
-        //        }
-        //    }
-        //    return node;
-        //}
-
         private LinkedListNode<T>? Traverse(int i)
         {
             //Start at given point in list