c++ ptree判断是否存在节点_二叉树中序遍历以栈的方式实现，不知哪里逻辑错误了？...

自己以栈的方式实现了一遍二叉树中序遍历，运行也没问题，但似乎是陷入了死循环，有没有高人点播下，代码如下：

#include

#include

#include

using namespace std;

static int count = 0;

struct TreeNode{

int val;

TreeNode *left;

TreeNode *right;

TreeNode(int x = 0):val(x),left(NULL),right(NULL){}

};

//中序遍历

vector inorderTraveral(TreeNode *root){

vector res;

stack s;

TreeNode *pTree = new TreeNode();

if(root != nullptr){

s.push(root);

}

while(!s.empty()){

pTree = s.top();

if(pTree->left != nullptr){

s.push(pTree->left);

continue;

}

res.push_back(pTree->val);

s.pop();

if(pTree->right != nullptr)

s.push(pTree->right);

}

return res;

}

//递归遍历二叉树

void printTree(TreeNode *root){

cout<val<

if(root->left != nullptr){

printTree(root->left);

}

if(root->right != nullptr){

printTree(root->right);

}

}

//制造一个个数为k的完全二叉树

void makeTree(TreeNode* root,int k){

TreeNode *tmpTree = new TreeNode(1);

sranddev();

tmpTree->val = rand()%100;

if(count < k && root->left == nullptr){

root->left = tmpTree;

count++;

}else if(count < k && root->right == nullptr){

root->right = tmpTree;

count++;

}

if(count < k){

makeTree(root->left,k);

makeTree(root->right,k);

}

}

int main(){

TreeNode *root = new TreeNode(10);

int size;

size = 10;

TreeNode *root1,*root2;

root1 = root2;

makeTree(root,10);

printTree(root);

cout<

vector res;

res = inorderTraveral(root);

for(vector::iterator it = res.begin(); it != res.end();it++){

cout<

}

cout<

}

输出陷入死循环，如下：

➜ leetcode ./a.out 10 14 90 14 80 42 40 63 30 81 16

谢谢你的提醒，后来参考了别人的代码，更改成功了，如下：

#include

#include

using namespace std;

bool seqIsValid(const char*);

char seqRight(char);

bool seqIsValid(const char *str){

stack strStack;

for(;*str != '\0';str++){

if(!strStack.empty()){

if(seqRight(strStack.top()) != *str){

strStack.push(*str);

}else{

strStack.pop();

}

}else{

strStack.push(*str);

}

}

if(!strStack.empty()){

return false;

}

return true;

}

char seqRight(char ch){

switch(ch){

case '[':

return ']';

case '{':

return '}';

case '(':

return ')';

default:

return '\0';

}

}

int main(){

const char* test = "[{()}]";

if(seqIsValid(test)){

cout<

}else{

cout<

}

}