What is the space complexity of the in-order traversal in the recursive fashion? (d is the tree depth and n is the numbe
Posted: Wed Jul 13, 2022 7:42 pm
a) O(1)
b) O(nlogd)
c) O(logd)
d) O(d)
b) O(nlogd)
c) O(logd)
d) O(d)
Accurate answers. Every time.
https://answerhappy.com/