摘要：
//1.s型顺序访问二叉树,默认先左后右；利用两个栈来实现；如果先右后左的话，改变一下入栈的顺序就行 //2.注意s1 s2插入栈的顺序是不同的 void S_LevelOrderPrint(TreeNode t) { stack s1; stack s2; s1.push(t); while(!s1.empty() || !s2.empty()) { ... 阅读全文
Excaliburer`s ZoneIt was challenging, but not risky. |