enable node lookup

Author: justcoding121

src/Advanced.Algorithms/DataStructures/Dictionary/OrderedDictionary.cs

@@ -20,7 +20,7 @@ public class OrderedDictionary<K, V> : IEnumerable<KeyValuePair<K, V>> where K :
 
         public OrderedDictionary()
         {
-            binarySearchTree = new RedBlackTree<OrderedKeyValuePair<K, V>>();
+            binarySearchTree = new RedBlackTree<OrderedKeyValuePair<K, V>>(true);
         }
 
         /// <summary>
@@ -215,6 +215,11 @@ internal OrderedKeyValuePair(K key, V value)
             this.Value = value;
         }
 
+        public KeyValuePair<K, V> ToKeyValuePair()
+        {
+            return new KeyValuePair<K, V>(Key, Value);
+        }
+
         public int CompareTo(object obj)
         {
             if (obj is OrderedKeyValuePair<K, V> itemToComare)
@@ -225,10 +230,16 @@ public int CompareTo(object obj)
             throw new ArgumentException("Compare object is nu");
         }
 
-        public KeyValuePair<K, V> ToKeyValuePair()
+        public override bool Equals(object obj)
         {
-            return new KeyValuePair<K, V>(Key, Value);
+            return Key.Equals(((OrderedKeyValuePair<K, V>)obj).Key);
         }
+
+        public override int GetHashCode()
+        {
+            return Key.GetHashCode();
+        }
+
     }
 
     internal class SortedDictionaryEnumerator<K, V> : IEnumerator<KeyValuePair<K, V>> where K : IComparable

src/Advanced.Algorithms/DataStructures/HashSet/OrderedHashSet.cs

@@ -18,7 +18,7 @@ public class OrderedHashSet<T> : IEnumerable<T> where T : IComparable
 
         public OrderedHashSet()
         {
-            binarySearchTree = new RedBlackTree<T>();
+            binarySearchTree = new RedBlackTree<T>(true);
         }
 
         /// <summary>