【LeetCode】103. Binary Tree Zigzag Level Order Traversal

【【LeetCode】103. Binary Tree Zigzag Level Order Traversal】的更多相关文章

【LeetCode】103. Binary Tree Zigzag Level Order Traversal

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,#…

【一天一道LeetCode】#103. Binary Tree Zigzag Level Order Traversal

一天一道LeetCode 本系列文章已全部上传至我的github,地址:ZeeCoder's Github 欢迎大家关注我的新浪微博,我的新浪微博欢迎转载,转载请注明出处 (一)题目来源: https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/ Given a binary tree, return the zigzag level order traversal of its nodes' values…

leetCode ：103. Binary Tree Zigzag Level Order Traversal (swift) 二叉树Z字形层次遍历

// 103. Binary Tree Zigzag Level Order Traversal // https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/description/ // swift // Definition for a binary tree node. public class TreeNode { public var val: Int public var left: TreeNo…

剑指offer从上往下打印二叉树、leetcode102. Binary Tree Level Order Traversal(即剑指把二叉树打印成多行、层序打印）、107. Binary Tree Level Order Traversal II 、103. Binary Tree Zigzag Level Order Traversal(剑指之字型打印)

从上往下打印二叉树这个是不分行的,用一个队列就可以实现 class Solution { public: vector<int> PrintFromTopToBottom(TreeNode* root) { vector<int> result; queue<TreeNode* > container; if(root == NULL) return result; container.push(root); ){ TreeNode* rot = container.f…