ACM__dongsheng的博客

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

装载于：http://blog.csdn.net/qq_20581563/article/details/51095639 //深度优先算法： void depthFirstSearch(Tree* root){ stack<Tree *> nodeStack; //使用C++的STL标准模板库 nodeStack.push(root);