feat(treeMap): get last entry (highest value)

Author: amejiarosario

src/data-structures/maps/tree-maps/tree-map.js

@@ -18,6 +18,11 @@ const Tree = require('../../trees/red-black-tree'); // fast insertion
  *        allocate memory beforehand (e.g. HashMap’s initial capacity)
  *        nor you have to rehash when is getting full.
  *
+ * Implementations in other languages:
+ * Java: https://docs.oracle.com/en/java/javase/15/docs/api/java.base/java/util/TreeMap.html
+ * C++: https://en.cppreference.com/w/cpp/container/map
+ * Python: none
+ *
  */
 class TreeMap {
   // tag::constructor[]
@@ -92,6 +97,13 @@ class TreeMap {
   }
   // end::delete[]
 
+  lastEntry() {
+    return {
+      key: this.tree.getRightmost().value,
+      value: this.tree.getRightmost().data(),
+    };
+  }
+
   // tag::iterators[]
   /**
    * Default iterator for this map

src/data-structures/maps/tree-maps/tree-map.spec.js

@@ -0,0 +1,29 @@
+// some parts tested on src/data-structures/maps/map.spec.js
+
+const TreeMap = require('./tree-map');
+
+describe('TreeMap: keep values sorted', () => {
+  let map;
+
+  beforeEach(() => {
+    map = new TreeMap();
+  });
+
+  describe('when items has ', () => {
+    beforeEach(() => {
+      map.set(20, { title: '3sum', passed: true });
+      map.set(30, { title: '3sum', passed: false });
+      map.set(10, { title: '2sum', passed: true });
+      map.set(5, { title: '4sum', passed: false });
+    });
+
+    describe('#lastEntry', () => {
+      it('should get last entry', () => {
+        expect(map.lastEntry()).toEqual({
+          key: 30,
+          value: { title: '3sum', passed: false },
+        });
+      });
+    });
+  });
+});