Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Am I right in thinking this is O(n)? I’m really bad at recursion. Could someone please confirm, or explain to me?
Counter(a)
if hasLeft(a)
return Counter(left(a) + Counter (right(a))
else
return 1
Basically, if there isn’t a left node in the tree, it returns 0. If there are left notes, it returns 1.
Thanks!
If it’s (binary) tree, because there isn’t any loop in graph, it just check each node at most one time so it’s
O(n).