r = dfs(len-l,b+l,c+l-1); return res; } void bfs() { //层序遍历 queue<int> q; q.push(1); while(q.size()) { int cur = q.front(); q.pop(); if(cur != 1) printf(" "); printf("%d",node[cur].val); if(node[cur].l != -1) q.push(node[cur].l); if(node...