1, 2, 4, 7, 8, 3, 5, 9, 10, 6, 11

7, 4, 8, 2, 1, 9, 5, 10, 3, 6, 11

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11

7, 8, 4, 2, 9, 10, 5, 11, 6, 3, 1

What order would a post-order traversal access the values in this tree?

 1 / \ 2 3 / / \ 4 5 6 / \ / \ \ 7 8 9 10 11

1, 2, 4, 7, 8, 3, 5, 9, 10, 6, 11

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11

7, 8, 4, 2, 9, 10, 5, 11, 6, 3, 1

7, 4, 8, 2, 1, 9, 5, 10, 3, 6, 11

What order could a breadth-first traversal access the nodes in this tree?

 1 / \ 2 3 / / \ 4 5 6 / \ / \ \ 7 8 9 10 11

O(5n)

O(n)

O(n + 5)

O(n^2)

O(log 5n)

If you refactor an algorithm with a time complexity of O(n + 10) to be four times faster, what would the new time complexity be?