Suppose that we had a general tree and that each node stores one integer value. Suppose, too, that we wanted to use tree traversal algorithms to find the maximum of all of the values stored in the nodes. If we used a depth-first traversal to find the maximum value, would this be considered a divide and conquer algorithm? Briefly explain why or why not. If we used a breadth-first traversal to find the maximum value, would this be considered a divide and conquer algorithm? Briefly explain why or why not.

Please solve this questions

Given a binary tree T and a source node s in it, provide the pseudocode for an iterative algorithm to traverse T starting from s using breadth-first traversal, also known as level-order traversal. Each node in T contains an integer key that can be accessed. Each time a node is visited, its key should be printed. Note: You do not have to implement your algorithm.

Examine the BST below, and recall that a tree is just an acyclic (and, in this case, undirected) graph. Let's say we start at node 15 and want to determine if a path exists to node 18. List the order in which our method will visit the nodes of the tree, assuming a) we are using breadth-first search (BFS), b) our method visits the left subtree before it visits the right subtree, and c) our method terminates when we reach node 18. This question is asking you for a single sequence of nodes that meet all three criteria. It is NOT asking for three separate sequences (one for each criterion). You do not have to list any nodes to which you "return" during your traversal. No node in your sequence should be listed more than once. (JAVA) 1 7 / 12 15 1 20 1 / 1 14 16 22 1 18