If you use a breadth-first (expanding left to right) algorithm for printing all nodes of the following three.

If you use a breadth-first (expanding left to right) algorithm for printing all nodes of the following three.

If you use a breadth-first (expanding left to right) algorithm for printing all nodes of the following three.


A
|\
B C
|  \
D   E

What your output would be? :



  1.     ABDCE
  2.     ABCDE
  3.     ACEDB
  4.     DEBCA