Update README.md

projects/ancestor/README.md

@@ -9,15 +9,19 @@ Suppose we have some input data describing a graph of relationships between pare
 
 For example, in this diagram and the sample input, 3 is a child of 1 and 2, and 5 is a child of 4:
 
+```
  10
  /
 1   2   4  11
  \ /   / \ /
   3   5   8
    \ / \   \
     6   7   9
+```
+
 Write a function that, given the dataset and the ID of an individual in the dataset, returns their earliest known ancestor – the one at the farthest distance from the input individual. If there is more than one ancestor tied for "earliest", return the one with the lowest numeric ID. If the input individual has no parents, the function should return -1.
 
+```
 Example input
   6
 
@@ -33,6 +37,8 @@ Example input
   10 1
 Example output
   10
+```
+
 Clarifications
 The input will not be empty.
 There are no cycles in the input.