class Solution {
public:
vector<vector<int> > Print(TreeNode* pRoot) {
vector<vector<int>> v1;
vector<int> v2;
if(pRoot == nullptr)
return v1;
stack<TreeNode*> s1;
stack<TreeNode*> s2;
s1.push
按之字形打印二叉树
最新推荐文章于 2021-08-13 17:21:19 发布