push(NULL); 29 int nLevelCount = 1; 30 while (true) { 31 TreeNode *pTemp = tree_queue.front(); 32 tree_queue.pop(); 33 if (pTemp == NULL) { 34 if (nLevelCount%2 == 0) { //if the num of level is odd, swap the ive
val); } level = curLevel + 1; treeNode.offer(curNode.left); nodeLevel.offer(level); treeNode.offer(curNode.right); nodeLevel.offer(level); } } return ans; } 第二种方案 把102 题 的解释贴过来。 我们在 while 循环中加一个 for 循环,循环次数是循环前的队列中的元素个数即可,使得每次的...
Given a binary tree, return thezigzag level ordertraversal of its nodes' values. (ie, from left to right, then right to left for the next level and alternate between). For example: Given binary tree[3,9,20,null,null,15,7], 3 / \ 9 20 / \ 15 7 return its zigzag level order t...
return its zigzag level order traversal as: [ [3], [20,9], [15,7] ] 先输出成arraylist,然后再反转即可。 1/**2* Definition for binary tree3* public class TreeNode {4* int val;5* TreeNode left;6* TreeNode right;7* TreeNode(int x) { val = x; }8* }9*/10publicclassSolution...
103. Binary Tree Zigzag Level Order Traversal Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and alternate between). For example: Given binary tree [3,9,20,null,null,15,7], 代码语言:...
levelTraversal(root->right, level+1, !leftToRight, result); } }; 2. 迭代解法 // 迭代解法 classSolution{ public: vector<vector<int>> zigzagLevelOrder(TreeNode* root) { vector<vector<int> > result; if(!root)returnresult;
Binary Tree Zigzag Level Order Traversal Given a binary tree, return thezigzag level ordertraversal of its nodes' values. (ie, from left to right, then right to left for the next level and alternate between). For example: Given binary tree{3,9,20,#,#,15,7},...
103.binary-tree-zigzag-level-order-traversal Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and alternate between). For example: Given binary tree [3,9,20,null,null,15,7],...
103. Binary Tree Zigzag Level Order Traversal 58b6ace olsen-blue reviewed Mar 2, 2025 View reviewed changes 103/step3.cpp vector<TreeNode*> current_level_nodes = {root}; while (!current_level_nodes.empty()) { vector<TreeNode*> next_level_nodes; level_ordered_vals.push_back({...
103. Binary Tree Zigzag Level Order Traversal.md return [] nodes = [root] level = 0 ans = [] nodchip Feb 27, 2024 ans について、プログラム中で何を表しているかを表す単語にした方が良いと思います。自分なら order とつけますが、もう少し良い名前があるかもしれません...