LeetCode Range Sum of BST Explained - Java

[@milad950]

That was super helpful. Thank you very much Nick!

[@pubamx]

What about Time & Space complexity and which solution (iteratively && recursive) could be better?

[@codemonkey2614]

I guess recursive time complexity should be Big O of N (the total number of nodes) under the worse case in which L equals the smallest node and R equals the biggest node in BST.

[@Randomguu]

couple of points recursive is always worse, the java virtual machine needs to maintain the recursive stack pointers so thats more space and they are located randomly within your ram so it cannot be easily cached by cpu so time is also worse, also we never take advantage of the binary nature of the tree, I would go for binary search to find first element bigger than L and then do in order traversal on its right subtree until wwe reach > R then stop. Think thats the most optimal approach

[@snowyalbino130]

Great stuff mate, thanks!

[@NickWhite]

Thanks for watching dude!

[@atharvakulkarni2024]

this iterative approach is giving tle in cpp

[@MrThepratik]

nice one nick

[@optussport337]

How was the Organic Chemistry Class? XD

[@harryz7973]

good job Nick

[@jinhuacao253]

thanks nick

[@avinashpatil5572]

Done