摘要:
Print all edge nodes of a complete binary tree anti-clockwise. That is all the left most nodes starting at root, then the leaves left to right and finally all the rightmost nodes. In other words, print the boundary of the tree.Variant: Print the same for a tree that is not complete.Solution:#include 阅读全文
posted @ 2013-07-18 21:54
pgu2
阅读(308)
评论(0)
推荐(0)
浙公网安备 33010602011771号