Loading...
Engaged employer
Write a method to traverse a Binary Tree
Anonymous
recursive: fun traverse(t) print t if (t is leaf) else traverse(t.left) traverse(t.right)
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.