1102 scanf %c和getchar

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
using namespace std;
struct Node{
	int rchild,lchild;
}node[13];
bool isroot[13] = {false};
int n,num = 0;
void bfs(int v)
{
		queue<int> q;
	    q.push(v);
	    while(!q.empty())
	    {
	    	int now = q.front();
	    	q.pop(); 
	    	if(num != 0) printf(" ");
	    	printf("%d",now);
	    	num++;
	    	if(node[now].rchild != -1) q.push(node[now].rchild);
	    	if(node[now].lchild != -1) q.push(node[now].lchild);
	    }
} 
void inorder(int v)
{
	if(v== -1) return;
	inorder(node[v].rchild);
	if(num != 0) printf(" ");
	printf("%d",v);
	num++;
	inorder(node[v].lchild);
}
int main()
{
	char u,v;
	scanf("%d",&n);
	getchar();
    for(int i = 0; i < n; i++)	
    {
    	scanf("%c %c",&u,&v);
		getchar(); 
    	if(u == '-') node[i].lchild = -1;
    	else node[i].lchild = u-'0';
    	if(v == '-') node[i].rchild = -1;
    	else node[i].rchild = v-'0';
    	if(isroot[node[i].lchild] == false)
    	isroot[node[i].lchild] = true;
    	if(isroot[node[i].rchild] == false)
    	isroot[node[i].rchild] = true;
    }
    int root = -1;
	for(int i = 0; i < n; i++)
	{
		if(isroot[i] == false)
		{
			root = i;
			break;
		}
	}
	bfs(root);
	printf("\n");
	num = 0;
	inorder(root);
	
	return 0;
}