tag:blogger.com,1999:blog-8522573717713847738.post8632079340542283331..comments2024-03-28T00:14:29.070-07:00Comments on Yu's Coding Garden : leetcode Question 109: Symmetric TreeAnonymoushttp://www.blogger.com/profile/00263085222060621782noreply@blogger.comBlogger2125tag:blogger.com,1999:blog-8522573717713847738.post-7004220444026844232015-10-10T10:03:58.795-07:002015-10-10T10:03:58.795-07:00I made this way too. The queue method is complex f...I made this way too. The queue method is complex for this question. Basic recursion is easier to do than using queues to store values at each level.Anonymoushttps://www.blogger.com/profile/06880390300232101320noreply@blogger.comtag:blogger.com,1999:blog-8522573717713847738.post-41310395282521919382014-11-16T20:44:52.786-08:002014-11-16T20:44:52.786-08:00class Solution {
public:
bool compare(TreeNode...class Solution {<br />public:<br /> bool compare(TreeNode * left, TreeNode * right) {<br /> if (left == NULL && right== NULL) return true;<br /> if((left == NULL && right!= NULL) || (left != NULL && right == NULL) ) return false; <br /> if (left->val != right->val) return false;<br /> return (compare(left->left, right->right) && compare(left->right, right->left));<br /> }<br /> bool isSymmetric(TreeNode *root) {<br /> if(root == NULL) return true;<br /> return compare(root->left, root->right);<br /> <br /> }<br />};Anonymoushttps://www.blogger.com/profile/15407279245400852685noreply@blogger.com