#include <iostream> class Solution { public: vector<vector<int> > Print(TreeNode* pRoot) { stack<TreeNode*> st;//从左往右,显示,将下一层,从左往右顺序压入栈st1中,准备从右向左出栈 stack<TreeNode*> st1;//从右往左显示,将下一层按从右向左顺序,压入栈st,准备从左向右出栈 if(pRoot != NULL) st.push(pRoot); //...