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

力扣https://leetcode-cn.com/problems/binary-tree-zigzag-level-order-traversal/

C#

//层序遍历之字型打印
public class Solution {
    public IList> ZigzagLevelOrder(TreeNode root) {
        var q=new Queue();
        var ret=new List>();
        if(root==null) return ret;
        q.Enqueue(root);
        while(q.Count>0){
            int size=q.Count;
            var list=new List();
            for(int i=0;i