东华大学oj二叉树：x的兄弟

#include<iostream>
#include<cmath>
#include<vector>
#include<string>
#include<map>
#include<list>
#include<stack>
#include<queue>
#include<algorithm>
#define ll long long
#define elif else if
using namespace std;
int main()
{
	char a;
	char array[1026] = { 0 };
	int p = 2;
	cin >> a;
	while (cin >> a)
	{
		if (p == 3)
			break;
		if (a == '#')
		{
			array[p] = a;
			if (p % 2 == 0)
				++p;
			else
			{
				do
				{
					p = (p - 1) / 2;
				} while (p % 2 == 1);
				++p;
			}
		}
		else
		{
			array[p] = a;
			p *= 2;
		}
	}
	int flag;
	cin >> flag;
	for (int i = 0; i < 1026; ++i)
	{
		
		if (array[i] == a)
		{
			if (!flag)
				a=array[i - 1];
			else
				a= array[i + 1];
			break;
		}

	}
	if (a == 0)
		cout << "NULL";
	else
		cout << a;
	return 0;
}