struct TreeNode {
int val;
struct TreeNode *left;
struct TreeNode *right;
TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};
TreeNode* createTree(vector<string> nodes) {
int len = nodes.size();
int current = 0;
vector<TreeNode*> pNodes;
TreeNode* pCurNode;
while (current < len) {
if (nodes[current] != "#")
pCurNode
层次遍历构建二叉树
最新推荐文章于 2022-12-06 20:31:59 发布