Traversing a tree means visiting every node in it. Consider a function that does a preorder traversal of a binary tree, and as it visits each node of that tree it adds to a list the key for that node. The function returns the list of node keys.

Given the following graphical representation of a binary tree, what list would that function return?

77 11 62 10 4 48 6 7 8 2 0 3 32 5 5 1 Select one: [77, 11, 10, 7, 8, 4, 2,0, 62, 48, 3, 32, 6, 5, 1] O [11, 77, 7, 10, 4, 8, 0, 2, 48, 62, 32, 3, 5, 1, 6] [7, 8, 10, 2, 0, 4, 11, 3, 32, 48, 5, 1, 6, 62, 77] [0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 11, 32, 48, 62, 77] O [10, 7, 11, 8, 4, 2, 77, 0, 48, 3, 62, 32, 6, 5, 1] O [7, 10, 8, 11, 2, 4, 0, 77, 3, 48, 32, 62,5, 6, 1] [77, 62, 48, 32, 11, 10, 8, 7, 6, 5, 4, 3, 2, 1, 0]