Melysegi bejaras

#include <iostream>
#include <fstream>

using namespace std;

void be(int szl[50][50], int& n) {
	ifstream fin("be.txt");

	fin >> n;

	for (int i = 1; i < n; i++) {
		fin >> szl[i][0];

		for (int j = 1; j <= szl[i][0]; j++)
			fin >> szl[i][j];
	}
}

void melysegi(int szl[50][50], int n, int kp) {
	int e = 0, u = 1, ok = 0;
	int freq[50] = {0}, verem[50], ut[50];

	//kezdoertekek
	ut[0] = kp;
	freq[kp]++;
	verem[0] = kp;

	int csp;
	while (e >= 0) {
		csp = verem[e];
		ok = 0;

		for (int i = 1; i <= szl[csp][0] && ok == 0; i++) {
			if (freq[szl[csp][i]] == 0) {
				ok = 1;
				verem[++e] = szl[csp][i];
				ut[u++] = szl[csp][i];
				freq[szl[csp][i]]++;
			}
		}

		if (ok == 0) e--;
	}

	//kiiratas
	for (int i = 0; i < u; i++)
		cout << ut[i] <<' ';
}

int main()
{
	int szl[50][50], n;
	be(szl, n);
	melysegi(szl, n, 1);
}