fix bug in casting for bsts

justcoding121 · justcoding121 · commit 66cd21c366ef · 2019-01-04T23:02:21.000-05:00
diff --git a/src/Advanced.Algorithms/DataStructures/Tree/AvlTree.cs b/src/Advanced.Algorithms/DataStructures/Tree/AvlTree.cs
@@ -419,7 +419,7 @@ private AVLTreeNode<T> find(T value)
                 return nodeLookUp[value] as AVLTreeNode<T>;
             }
 
-            return Root.Find<T>(value) as AVLTreeNode<T>;
+            return Root.Find(value).Item1 as AVLTreeNode<T>;
         }
 
         //find the node with the given identifier among descendants of parent and parent
diff --git a/src/Advanced.Algorithms/DataStructures/Tree/BST.cs b/src/Advanced.Algorithms/DataStructures/Tree/BST.cs
@@ -395,7 +395,7 @@ private BSTNode<T> find(BSTNode<T> parent, T value)
         //O(log(n)) worst O(n) for unbalanced tree
         private BSTNodeBase<T> find(T value)
         {
-            return Root.Find<T>(value) as BSTNodeBase<T>;
+            return Root.Find<T>(value).Item1 as BSTNodeBase<T>;
         }
 
         /// <summary>
diff --git a/src/Advanced.Algorithms/DataStructures/Tree/SplayTree.cs b/src/Advanced.Algorithms/DataStructures/Tree/SplayTree.cs
@@ -494,7 +494,7 @@ private SplayTreeNode<T> leftRotate(SplayTreeNode<T> currentRoot)
         //O(log(n)) worst O(n) for unbalanced tree
         private BSTNodeBase<T> find(T value)
         {
-            return Root.Find<T>(value) as BSTNodeBase<T>;
+            return Root.Find<T>(value).Item1 as BSTNodeBase<T>;
         }
 
         /// <summary>
diff --git a/src/Advanced.Algorithms/DataStructures/Tree/TreapTree.cs b/src/Advanced.Algorithms/DataStructures/Tree/TreapTree.cs
@@ -489,7 +489,7 @@ private TreapTreeNode<T> leftRotate(TreapTreeNode<T> currentRoot)
         //O(log(n)) worst O(n) for unbalanced tree
         private BSTNodeBase<T> find(T value)
         {
-            return Root.Find<T>(value) as BSTNodeBase<T>;
+            return Root.Find<T>(value).Item1 as BSTNodeBase<T>;
         }
 
         /// <summary>

Original file line number	Diff line number	Diff line change
`@@ -419,7 +419,7 @@ private AVLTreeNode<T> find(T value)`
`419`	`419`	`return nodeLookUp[value] as AVLTreeNode<T>;`
`420`	`420`	`}`
`421`	`421`
`422`		`- return Root.Find<T>(value) as AVLTreeNode<T>;`
	`422`	`+ return Root.Find(value).Item1 as AVLTreeNode<T>;`
`423`	`423`	`}`
`424`	`424`
`425`	`425`	`//find the node with the given identifier among descendants of parent and parent`
Original file line number	Diff line number	Diff line change
`@@ -395,7 +395,7 @@ private BSTNode<T> find(BSTNode<T> parent, T value)`
`395`	`395`	`//O(log(n)) worst O(n) for unbalanced tree`
`396`	`396`	`private BSTNodeBase<T> find(T value)`
`397`	`397`	`{`
`398`		`- return Root.Find<T>(value) as BSTNodeBase<T>;`
	`398`	`+ return Root.Find<T>(value).Item1 as BSTNodeBase<T>;`
`399`	`399`	`}`
`400`	`400`
`401`	`401`	`/// <summary>`
Original file line number	Diff line number	Diff line change
`@@ -494,7 +494,7 @@ private SplayTreeNode<T> leftRotate(SplayTreeNode<T> currentRoot)`
`494`	`494`	`//O(log(n)) worst O(n) for unbalanced tree`
`495`	`495`	`private BSTNodeBase<T> find(T value)`
`496`	`496`	`{`
`497`		`- return Root.Find<T>(value) as BSTNodeBase<T>;`
	`497`	`+ return Root.Find<T>(value).Item1 as BSTNodeBase<T>;`
`498`	`498`	`}`
`499`	`499`
`500`	`500`	`/// <summary>`
Original file line number	Diff line number	Diff line change
`@@ -489,7 +489,7 @@ private TreapTreeNode<T> leftRotate(TreapTreeNode<T> currentRoot)`
`489`	`489`	`//O(log(n)) worst O(n) for unbalanced tree`
`490`	`490`	`private BSTNodeBase<T> find(T value)`
`491`	`491`	`{`
`492`		`- return Root.Find<T>(value) as BSTNodeBase<T>;`
	`492`	`+ return Root.Find<T>(value).Item1 as BSTNodeBase<T>;`
`493`	`493`	`}`
`494`	`494`
`495`	`495`	`/// <summary>`