对称二叉树

#include<bits/stdc++.h>
using namespace std;
string s;
int main()
{
	//freopen("tree_c.in","r",stdin);
	//freopen("tree_c.out","w",stdout);
	cin>>s;
	for(int i=1;i<s.length();i+=2)
	{
		if((s[i]!='#'&& s[i+1]=='#') || (s[i+1]!='#'&&s[i]=='#') ||s[i+1]=='\0')
		{
			printf("No");
			return 0;
		}
	}
	printf("Yes");
	return 0;
}

不用建树....就挺神奇的