Give a binary tree, elegantly print it so that no two tree nodes share the same column.
Requirement: left child should appear on the left column of root, and right child should appear on the right of root.
Example:
a
b c
d e f
z g h i jGive a binary tree, elegantly print it so t
阅读背景：
U面经Prepare: Print Binary Tree With No Two Nodes Share The Same Column
来源：互联网
分享到：
