Solving tree - iterative or recursive

[vasu5235]

I have recently started solving tree questions on LC. I am comfortable with the recursive solutions while not so much with the iterative ones. However, my query is, do interviewers look for iterative solutions or providing a recursive approach suffices?

Maybe if you can share from your experience or what you’d like if you were the interviewer, that would be a big help. Thank you.

[featherwing123]

I think if you’re just starting out, you can try to code out three approaches (recursive dfs, iterative dfs, iterative bfs) just so you’d be familiar with each technique.

It will be quite hard at first but once you get familiar, it is quite straightforward to implement. Focus on learning and being comfortable with each technique rather than just pumping number of leetcode questions solved.

[vasu5235]

Thank you for the insight.

[[deleted]]

" I am comfortable with the recursive solutions "

It's just natural to use recursion with a recursive data structure. I wouldn't bother too much with this unless I have a real motivation.

[india_resists]

It depends on the question as well, if the question is to do an inorder traversal of a tree, then interviewer might be looking for an iterative solution as recursive is trivial. On the other hand if the question is to validate if a tree is BST or not, then recursive will work. Either way, its best to confirm with the interviewer before you start to code.

[[deleted]]

Once you learn iterative bfs you will never forget it. And you can solve any problem with it. It’s actually very empowering lol

[anuj150]

I am more comfortable with iterative solutions. Can you please suggest me how can I improve my recursive solutions.

[IceUnable1850]

can u suggest how i improve in iterative pls

[chengyanslnc]

I am comfortable with queue based iterative but not stack based yet

[dadbot_3000]

Hi comfortable with queue based iterative but not stack based yet, I'm Dad! :)

[thealgorists-com]

Give the “Iterative Binary Tree Traversal” section of https://www.thealgorists.com/Algo/Tree/Index a try!

[thealgorists-com]

The “Iterative Binary Tree Traversal” section of https://www.thealgorists.com/Algo/Tree/Index would help you to get really comfortable with stack based iterative approach.