vhvg vhcc Asks:

I’m trying to learn about Big O notation and I came across a problem. As in this code we’re trying to find the sum of the values of the nodes. And as there are 2 calls to sum function so each call will have twice as many calls than before. So why the runtime is O and not O(2^n).

*Why is the time complexity of the sum of the values of nodes in a balanced BST O?*I’m trying to learn about Big O notation and I came across a problem. As in this code we’re trying to find the sum of the values of the nodes. And as there are 2 calls to sum function so each call will have twice as many calls than before. So why the runtime is O and not O(2^n).

Code:

```
int sum(Node node) {
if(node==null)
return 0;
}
return sum(node.left) + node.value + sum(node.right);
}
```

Ten-tools.com may not be responsible for the answers or solutions given to any question asked by the users. All Answers or responses are user generated answers and we do not have proof of its validity or correctness. Please vote for the answer that helped you in order to help others find out which is the most helpful answer. Questions labeled as solved may be solved or may not be solved depending on the type of question and the date posted for some posts may be scheduled to be deleted periodically. Do not hesitate to share your response here to help other visitors like you. Thank you, Ten-tools.