diff --git a/src/libcollections/btree/map.rs b/src/libcollections/btree/map.rs
index 782a5e31d2ded8f3d0268cdcae7c505f770dfbf9..4755f8a4c55a43b3095acde1749916fc56215ccb 100644
--- a/src/libcollections/btree/map.rs
+++ b/src/libcollections/btree/map.rs
@@ -656,7 +656,7 @@ pub fn append(&mut self, other: &mut Self) {
     }
 
     /// Constructs a double-ended iterator over a sub-range of elements in the map.
-    /// The simplest way is to use the range synax `min..max`, thus `range(min..max)` will
+    /// The simplest way is to use the range syntax `min..max`, thus `range(min..max)` will
     /// yield elements from min (inclusive) to max (exclusive).
     /// The range may also be entered as `(Bound<T>, Bound<T>)`, so for example
     /// `range((Excluded(4), Included(10)))` will yield a left-exclusive, right-inclusive
@@ -748,7 +748,7 @@ pub fn range<T: ?Sized, R>(&self, range: R) -> Range<K, V>
     }
 
     /// Constructs a mutable double-ended iterator over a sub-range of elements in the map.
-    /// The simplest way is to use the range synax `min..max`, thus `range(min..max)` will
+    /// The simplest way is to use the range syntax `min..max`, thus `range(min..max)` will
     /// yield elements from min (inclusive) to max (exclusive).
     /// The range may also be entered as `(Bound<T>, Bound<T>)`, so for example
     /// `range((Excluded(4), Included(10)))` will yield a left-exclusive, right-inclusive