Merge pull request #6 from rkechols/tree-map

Implement TreeMap

README.md

@@ -7,23 +7,23 @@ Comprehensive package of Python-native datastructures.
 
 
 ### Planned Datastructures:
-  - tree set (AVL)
-  - tree map (AVL)
-  - ordered list (?) = binary tree (AVL) with duplicates (counts)
+  - tree set
+  - ordered list (?) = binary tree with duplicates (counts)
   - trie
   - disjoint set (forest)
   - graph (weighted or not, directed or not, sparse or not)
 
 
 ### Implemented Datastructures:
   - Heap (AKA priority queue)
+  - TreeMap
 
 
 ### Will Not Implement:
   - fixed-size array
   - dynamic array (use `list`)
   - linked list (use `collections.deque`)
-  - stack (use `collections.deque`)
+  - stack (use `collections.deque` or `list`)
   - queue (use `collections.deque`)
   - deque (use `collections.deque`)
   - hash set (use `set`)

ech_datastructures/__init__.py

@@ -1 +1,2 @@
 from .heap import Heap
+from .tree_map import TreeMap

ech_datastructures/heap.py

@@ -1,5 +1,5 @@
 import heapq
-from typing import Any, Callable, Generic, Iterable, TypeVar, List
+from typing import Any, Callable, Generic, Iterable, List, TypeVar
 
 
 T = TypeVar("T")