On the binary tree print C + +

Users questions: Requested by the shape of a binary tree print, can not reverse the binary tree. Come on little brother he just can not think, to the expert help! ! ! To do with C + +. Most grateful! ! !
Experts answer: using the queue to do, from the root node, the root node into the queue, define a special symbol node set X, while (team Column is not empty) (remove a node from the queue first point; if (this node = x) output newline; else print, and has its left and right non-empty nodes join the queue, then add a flag node X;) Print results into a ladder-like, but also to make necessary adjustments as needed
  • This information provided by the users.Thanks!