判斷二叉樹是不是鏡像

Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).node For example, this binary tree is symmetric:this 1 / \ 2 2 / \ / \ 3 4 4 3   But the fo

>>阅读原文<<