226.翻转二叉树
class Solution {
public:
void sweap(TreeNode* a, TreeNode* b) {
TreeNode* cur = a;
a = b;
b = cur;
}
TreeNode* invertTree(TreeNode* root) {
stack<TreeNode*> a;
vector<int> ret;
if (root != NULL)
a.push(root);
while (!a.empty()) {
TreeNode* node = a.top();
if (node != NULL) {
a.pop();
if (node->right)
a.push(node->right);
if (node->left)
a.push(node->left);
swap(node->left, node->right);
a.push(node);
a.push(NULL);
} else {
a.pop();
TreeNode* k = a.top();
a.pop();
ret.push_back(k->val);
}
}
return root;
}
};
101.对称二叉树 2
class Solution {
public:
bool compare(TreeNode* l, TreeNode* r) {
if (l == NULL && r != NULL)
return false;
else if (l != NULL && r == NULL)
return false;
else if (l == NULL && r == NULL)
return true;
else if(l->val != r->val)
return false;
if (compare(l->left, r->right) && compare(l->right, r->left)) {
return true;
}
return false;
}
bool isSymmetric(TreeNode* root) {
if (root == NULL)
return true;
return compare(root->left, root->right);
}
};