diff --git a/04. Trees and graphs/README.md b/04. Trees and graphs/README.md
index b90a32c..e5b1d51 100644
--- a/04. Trees and graphs/README.md	
+++ b/04. Trees and graphs/README.md	
@@ -170,7 +170,7 @@ The actual implementation of these * nodes can be a special type of child, like
 
 A node in a trie can have anywhere from 1 through `alphabet_size + 1` children.
 
-![trie](img/trie.png){width:300}
+![trie](img/trie.png | width=300)
 
 Commonly, a trie is used to store the entire (english) language for quick prefix lookups. While a hash table can quickly look up whether a string is a valid word, it can't tell if a string is a prefix of any valid words.
 
@@ -184,4 +184,4 @@ A tree is a type of graph, but not all graphs are trees. A tree is a connected g
 * The graph can have multiple isolated subgraphs. If there's a path between every pair of vertices, it's called a 'connected graph'
 * The graph can also have cycles. If it doesn't, it's called 'acyclic'
 
-![graph](img/graph.png){width:300}
+![graph](img/graph.png | width=300)