zoukankan      html  css  js  c++  java

  • LeetCode 103. 二叉树的锯齿形层序遍历

    思路

    方法：层序遍历

     1 class Solution {
 2 public:
 3     vector<vector<int>> zigzagLevelOrder(TreeNode* root) {
 4         vector<vector<int>> ans;
 5         if (!root) {
 6             return ans;
 7         }
 8 
 9         queue<TreeNode*> nodeQueue;
10         nodeQueue.push(root);
11         bool isOrderLeft = true;
12 
13         while (!nodeQueue.empty()) {
14             deque<int> levelList;
15             int size = nodeQueue.size();
16             for (int i = 0; i < size; ++i) {
17                 auto node = nodeQueue.front();
18                 nodeQueue.pop();
19