From 3f156498b0cb043f103eef22216f2e4e9df6edd6 Mon Sep 17 00:00:00 2001 From: Jawwad Ahmad Date: Mon, 1 May 2017 01:03:09 +0500 Subject: [PATCH] Fix alignment by adding an additional tab --- Tree/README.markdown | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/Tree/README.markdown b/Tree/README.markdown index 440d9c9a4..566864a8f 100644 --- a/Tree/README.markdown +++ b/Tree/README.markdown @@ -153,7 +153,7 @@ tree.search("bubbly") // nil It's also possible to describe a tree using nothing more than an array. The indices in the array then create the links between the different nodes. For example, if we have: - 0 = beverage 5 = cocoa 9 = green + 0 = beverage 5 = cocoa 9 = green 1 = hot 6 = soda 10 = chai 2 = cold 7 = milk 11 = ginger ale 3 = tea 8 = black 12 = bitter lemon