src/java.base/share/classes/java/util/concurrent/ConcurrentSkipListMap.java

@@ -2708,11 +2708,11 @@
             else
                 return m.findNear(hi, LT, cmp);
         }
 
         /**
-         * Returns lowest absolute key (ignoring directonality).
+         * Returns lowest absolute key (ignoring directionality).
          */
         K lowestKey() {
             Comparator<? super K> cmp = m.comparator;
             ConcurrentSkipListMap.Node<K,V> n = loNode(cmp);
             if (isBeforeEnd(n, cmp))

@@ -2720,11 +2720,11 @@
             else
                 throw new NoSuchElementException();
         }
 
         /**
-         * Returns highest absolute key (ignoring directonality).
+         * Returns highest absolute key (ignoring directionality).
          */
         K highestKey() {
             Comparator<? super K> cmp = m.comparator;
             ConcurrentSkipListMap.Node<K,V> n = hiNode(cmp);
             if (n != null) {