What is the running time to find the depth (dv) of a node v in a binary tree?

Select one:
O(1+dv)
O(n)
O(1)
O(dv)

Showing Answers 1 - 18 of 18 Answers

shruthi

  • Mar 9th, 2015
 

O(1+dv)

  Was this answer useful?  Yes

jsk

  • Oct 2nd, 2015
 

O(n)

  Was this answer useful?  Yes

Pavan

  • Oct 11th, 2015
 

O (n)

  Was this answer useful?  Yes

Gaurav

  • Jan 19th, 2016
 

O(1+dv)

  Was this answer useful?  Yes

jagadish dachepalli

  • Jun 2nd, 2016
 

Can you explain it?

  Was this answer useful?  Yes

Jenny

  • May 9th, 2017
 

O(1+dv)

  Was this answer useful?  Yes

Give your answer:

If you think the above answer is not correct, Please select a reason and add your answer below.

 

Related Answered Questions

 

Related Open Questions