Loading...
Engaged employer
write binary tree traversal without any recursion.
Anonymous
tocode
reasonable solution would be using stack or queue, and Morris traversal if constant space required.
Check out your Company Bowl for anonymous work chats.
Get actionable career advice tailored to you by joining more bowls.
Stay ahead in opportunities and insider tips by following your dream companies.
Get personalised job recommendations and updates by starting your searches.