原题链接:https://leetcode-cn.com/problems/cong-shang-dao-xia-da-yin-er-cha-shu-lcof/
vector<int> levelOrder(TreeNode* root) {
if (root == NULL) return {};
vector<int> ans;
queue<TreeNode*> Q;
Q.push(root);
while (!Q.empty()) {
TreeNode *t = Q.front();
Q.pop();
ans.push_back(t->val);
if (t->left) Q.push(t->left);
if (t->right) Q.push(t->right);
}
return ans;
}