Fix pseudocode formatting.

Author: trekhleb

src/algorithms/tree/breadth-first-search/README.md

@@ -10,29 +10,27 @@ nodes first, before moving to the next level neighbors.
 
 ## Pseudocode
 
-    BFS(root)
-        Pre: root is the node of the BST
-        Post: the nodes in the BST have been visited in breadth first order
-        q ← queue
-        while root = ø
-            yield root.value
-            if root.left = ø
-                q.enqueue(root.left)
-            end if
-            if root.right = ø
-                q.enqueue(root.right)
-            end if
-            if !q.isEmpty()
-                root ← q.dequeue()
-            else
-                root ← ø
-            end if
-        end while
-    end BFS
-
-## Space and Time Complexity: 
-
-O(b<sup>d + 1</sup>) 
+```text
+BFS(root)
+  Pre: root is the node of the BST
+  Post: the nodes in the BST have been visited in breadth first order
+  q ← queue
+  while root = ø
+    yield root.value
+    if root.left = ø
+      q.enqueue(root.left)
+    end if
+    if root.right = ø
+      q.enqueue(root.right)
+    end if
+    if !q.isEmpty()
+      root ← q.dequeue()
+    else
+      root ← ø
+    end if
+  end while
+end BFS
+```
 
 ## References
 

src/data-structures/doubly-linked-list/README.md

@@ -19,77 +19,84 @@ potentially more efficient (for nodes other than first nodes) because there
 is no need to keep track of the previous node during traversal or no need 
 to traverse the list to find the previous node, so that its link can be modified.
 
-## Pseudocode
+## Pseudocode for Basic Operations
 
 ### Insert
 
-    Add(value)
-        Pre: value is the value to add to the list
-        Post: value has been placed at the tail of the list
-        n ← node(value)
-        if head = ø
-            head ← n
-            tail ← n
-        else
-            n.previous ← tail
-            tail.next ← n1
-            tail ← n
-        end if
-    end Add
+```text
+Add(value)
+  Pre: value is the value to add to the list
+  Post: value has been placed at the tail of the list
+  n ← node(value)
+  if head = ø
+    head ← n
+    tail ← n
+  else
+    n.previous ← tail
+    tail.next ← n
+    tail ← n
+  end if
+end Add
+```
 
 ### Delete
-    Remove(head, value)
-        Pre: head is the head node in the list
-             value is the value to remove from the list
-        Post: value is removed from the list, true; otherwise false
-        if head = ø
-            return false
-        end if
-        if value = head.value
-            if head = tail
-                head ← ø
-                tail ← ø
-            else
-                head ← head.Next
-                head.previous ← ∅
-            end if
-            return true
-        end if
-        n ← head.next
-        while n = ø and value = n.value
-            n ← n.next
-        end while
-        if n = tail
-            tail ← tail.previous
-            tail.next ← ø
-            return true
-        else if n = ø
-            n.previous.next ← n.next
-            n.next.previous ← n.previous
-            return true
-        end if
-        return false
-    end Remove
+
+```text
+Remove(head, value)
+  Pre: head is the head node in the list
+       value is the value to remove from the list
+  Post: value is removed from the list, true; otherwise false
+  if head = ø
+    return false
+  end if
+  if value = head.value
+    if head = tail
+      head ← ø
+      tail ← ø
+    else
+      head ← head.Next
+      head.previous ← ø
+    end if
+    return true
+  end if
+  n ← head.next
+  while n = ø and value = n.value
+    n ← n.next
+  end while
+  if n = tail
+    tail ← tail.previous
+    tail.next ← ø
+    return true
+  else if n = ø
+    n.previous.next ← n.next
+    n.next.previous ← n.previous
+    return true
+  end if
+  return false
+end Remove
+```
 
 ### Reverse Traversal
-    ReverseTraversal(tail)
-        Pre: tail is the node of the list to traverse
-        Post: the list has been traversed in reverse order
-        n ← tail
-        while n = ø
-            yield n.value
-            n ← n.previous
-        end while
-    end Reverse Traversal
+
+```text
+ReverseTraversal(tail)
+  Pre: tail is the node of the list to traverse
+  Post: the list has been traversed in reverse order
+  n ← tail
+  while n = ø
+    yield n.value
+    n ← n.previous
+  end while
+end Reverse Traversal
+```
 
-## Big O
+## Complexities
 
 ## Time Complexity
 
-Access: O(n)
-Search: O(n)
-Insert: O(1)
-Delete: O(1)
+| Access    | Search    | Insertion | Deletion  |
+| :-------: | :-------: | :-------: | :-------: |
+| O(n)      | O(n)      | O(1)      | O(1)      |
 
 ### Space Complexity