Pergunta de entrevista da empresa LinkedIn

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

Respostas da entrevista

Sigiloso

9 de nov. de 2014

BFS, traverse children from left to right

2

Sigiloso

15 de mai. de 2015

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

Sigiloso

11 de out. de 2014

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

4