What is Time Complexity of the below pseudo code: Function DFS (head): curr = head count =

What is Time Complexity of the below pseudo code:

Transcribed Image Text:

Function DFS (head): curr = head count = 0; while (curr != None && curr.visited == False): count++; if (curr.1Child != None && curr.lChild.visited == False): curr= curr. 1Child else if (curr.rChild != None && else curr.rChild.visited == False): curr= curr.rChild; print curr.value curr.visited = 1; curr = head; print "count is : ", count