//1.s型顺序访问二叉树,默认先左后右;利用两个栈来实现;如果先右后左的话,改变一下入栈的顺序就行 //2.注意s1 s2插入栈的顺序是不同的 void S_LevelOrderPrint(TreeNode t) { stack<TreeNode> s1; stack<TreeNode> s2; s1.push(t); while(!s1.empty() || !s2.empty()) { if(!s1.empty()) { while(!s1.empty()) { TreeNode tn = s1.top(); cout<<tn.val<<""; if(tn.right != null) { s2.push(tn.right); } if(tn.left != null) { s2.push(tn.left); } } } else { while(!s2.empty()) { TreeNode tn = s2.top(); cout<<tn.val<<" "; if(tn.left != null) { s1.push(tn.left); } if(tn.right != null) { s1.push(tn.right); } } } } }
时间: 2024-10-11 13:38:23