Fix RB tree position

Author: justcoding121

src/Advanced.Algorithms/DataStructures/Tree/RedBlackTree.cs

@@ -146,7 +146,7 @@ private RedBlackTreeNode<T> find(T value)
         public int Insert(T value)
         {
             var node = InsertAndReturnNode(value);
-            return node.Position;
+            return Root.Position(value);
         }
 
         /// <summary>
@@ -361,7 +361,7 @@ public int Delete(T value)
                 return -1;
             }
 
-            var position = node.Position;
+            var position = Root.Position(value);
 
             delete(node);
 

src/Advanced.Algorithms/DataStructures/Tree/Shared/BSTNodeBase.cs

@@ -10,9 +10,6 @@ internal abstract class BSTNodeBase<T> where T : IComparable
         //Used to fasten kth smallest computation.
         internal int Count { get; set; } = 1;
 
-        //position of this node in sorted order of containing BST
-        internal int Position => Left == null ? 0 : Left.Count;
-
         internal virtual BSTNodeBase<T> Parent { get; set; }
 
         internal virtual BSTNodeBase<T> Left { get; set; }