Problem #8 (10 pts - CHALLENGE): Tree - a more complicated linked list. Assume you have a "Tree" data structure below (essentially a slightly more complicated linked list... with each node having two pointers instead of one). Sketch out an idea for an algorithm to visit every node in tree below. Hint #1 - creating a temporary supporting data-structure to keep track of the nodes you have not yet visited will be very helpful. Hint #2 - the size of this supporting data structure will change dynamically, 1 Node * Tree_head; 2 10 11 struct Node? int value; Node * left; Node * right; }; 4 5 14 15 12 13 6 7 8