diff options
author | Jack Sangdahl <[email protected]> | 2025-03-10 00:36:13 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-03-10 00:36:13 -0600 |
commit | 7c60dee83b436e8e8a667bf9f191beced8de4fc3 (patch) | |
tree | eb7a24ee2067f92245c57bb118e85a1baf15df50 /other/symmetric_tree.cpp | |
parent | 5d7cdc215e4ba1ec4cbb24c084cccb5e5e641468 (diff) | |
download | leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.tar.gz leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.zip |
chore: move cpp and rust code to directory
Diffstat (limited to 'other/symmetric_tree.cpp')
-rw-r--r-- | other/symmetric_tree.cpp | 33 |
1 files changed, 33 insertions, 0 deletions
diff --git a/other/symmetric_tree.cpp b/other/symmetric_tree.cpp new file mode 100644 index 0000000..fbd4bf3 --- /dev/null +++ b/other/symmetric_tree.cpp @@ -0,0 +1,33 @@ +// 101. Symmetric Tree +#include "leetcode.h" + +// given 'root' of binary tree, check whether it is a mirror of itself + +class Solution { +public: + bool isSymmetric(TreeNode *root) { + TreeNode *left, *right; + if (!root) + return true; + queue<TreeNode *> q1, q2; + q1.push(root->left); + q2.push(root->right); + while (!q1.empty() && !q2.empty()) { + left = q1.front(); + q1.pop(); + right = q2.front(); + q2.pop(); + if (left == NULL && right == NULL) + continue; + if (left == NULL || right == NULL) + return false; + if (left->val != right->val) + return false; + q1.push(left->left); + q1.push(left->right); + q2.push(right->right); + q2.push(right->left); + } + return true; + } +}; |