4. The average time complexity for searching in a binary search tree is O(n) O(n!) O(logn) O(nlogn) 5. Consider the following pseudo code for printing all the nodes of a binary tree: func traverse...

CSE2A

Fifth Question

Extracted text: 4. The average time complexity for searching in a binary search tree is O(n) O(n!) O(logn) O(nlogn) 5. Consider the following pseudo code for printing all the nodes of a binary tree: func traverse (node p) // if node p is not empty if (p is not empty) // traverse p's left child traverse (p.left); // traverse p's right child traverse (p.right); // print the data contained in p print (p.data); This code demonstrates this type of algorithm: Hash-first search algorithm Breadth-first search algorithm Depth-first search algorithm Lateral-first search algorithm 6. Which of the following statements is true? TCP is generally faster than UDP. TCP does not care about error recovery, while error recovery is extremely important in UDP. TCP is a connection-oriented protocol, while UDP is connectionless. In TCP, the order by which the packets are delivered is not as important as it is in UDP.