- #1

- 675

- 54

Say I have this tree with goal n, how do I calculate time complexity for it? Assume left to right traversal. I know the answer is a,b,c,x1,d,e,f,i,j,k,g,h,z,l,m,n. But I am not sure how to calculate time complexity here using the above formula