diff options
author | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
commit | a96b65cbfad7f62f3db6b2eab105e4e25c0414c5 (patch) | |
tree | e2a2b3f49f9fb741be81415266ac93e74cff42ec /other/symmetric_tree.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/symmetric_tree.cpp')
-rw-r--r-- | other/symmetric_tree.cpp | 33 |
1 files changed, 0 insertions, 33 deletions
diff --git a/other/symmetric_tree.cpp b/other/symmetric_tree.cpp deleted file mode 100644 index fbd4bf3..0000000 --- a/other/symmetric_tree.cpp +++ /dev/null @@ -1,33 +0,0 @@ -// 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; - } -}; |