diff --git a/C#/Datastructures/BinarySearchTree/Tree.cs b/C#/Datastructures/BinarySearchTree/Tree.cs
index 33cd490..146c456 100644
--- a/C#/Datastructures/BinarySearchTree/Tree.cs
+++ b/C#/Datastructures/BinarySearchTree/Tree.cs
@@ -44,17 +44,16 @@ namespace C_.Datastructures.BinarySearchTree
             //Insert to right
             node.Right = TreeNode<T>.Create(value);
             return;
-
-            
         }
 
         public bool Find(T? value){
-            if (Root.Value != default || Root.Value == value)
+            if (Root == default)
             {
 
             }
         }
 
+
         private TreeNode<T>? Descend(T value, TreeNode<T>? current)
         {//Keep trying to determine whether to go left or right until null node is found that can be appended to
             if (current == default)