lxc_visionary liuxiaochuang
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| void root_medium(TreeNode* root) {//中序，这个难 | |
| cout<<"中序遍历:"; | |
| stack<TreeNode* > sta; | |
| TreeNode * p = root; | |
| while(sta.size() || p) { | |
| while(p) { | |
| sta.push(p); | |
| p = p->left; | |
| } | |
| if (sta.size()) { |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| this is just a test. |