LinkedIn Interview Question

Print a tree like reading a book, left to right.

Interview Answers

Anonymous

Nov 9, 2014

BFS, traverse children from left to right

2

Anonymous

May 15, 2015

@Bella: How is it in-order traversal? Its BFS, not in-order traversal.

Anonymous

Oct 11, 2014

If the tree is binary tree, then it's in-order tree traversal.

4