7. Consider the following pseudo code for printing all the nodes of a binary tree: func traverse (node p) 1 // if node p is not empty if (p is not empty) { Il traverse p's left child traverse (p.left); 1/ traverse p's right child traverse (p.right); // print the data contained in p print (p.data); 3 1 This code demonstrates this type of algorithm: Hash-first search algorithm Breadth-first search algorithm Depth-first search algorithm Lateral-first search algorithm