103. Binary Tree Zigzag Level Order Traversal

深度优先DFS算法

public class Solution {
    public List < List < Integer >> zigzagLevelOrder(TreeNode root)
    {
        List < List < Integer >> sol = new ArrayList<>();
        travel(root, sol, 0 );
        return sol;
    }
   
    private void travel(TreeNode curr, List < List < Integer >> sol, int level)
    {
        if (curr == null ) return ;
       
        if (sol.size() <= level)
        {
            List < Integer > newLevel = new LinkedList<>();
            sol.add(newLevel);
        }
       
        List < Integer > collection  = sol.get(level);
        if (level % 2 == 0 ) collection.add(curr.val);
        else collection.add( 0 , curr.val);
       
        travel(curr.left, sol, level + 1 );
        travel(curr.right, sol, level + 1 );
    }
}

广度优先DFS算法

public List < List < Integer >> zigzagLevelOrder(TreeNode root) {
   TreeNode c=root;
   List < List < Integer >> ans = new ArrayList< List < Integer >>();
   if (c== null ) return ans;
   Stack <TreeNode> s1= new Stack <TreeNode>();
   Stack <TreeNode> s2= new Stack <TreeNode>();
   s1.push(root);
   while (!s1.isEmpty()||!s2.isEmpty())
   {
       List < Integer > tmp= new ArrayList< Integer >();
        while (!s1.isEmpty())
        {
            c=s1.pop();
            tmp.add(c.val);
            if (c.left!= null ) s2.push(c.left);
            if (c.right!= null ) s2.push(c.right);
        }
        ans.add(tmp);
        tmp= new ArrayList< Integer >();
        while (!s2.isEmpty())
        {
            c=s2.pop();
            tmp.add(c.val);
            if (c.right!= null )s1.push(c.right);
            if (c.left!= null )s1.push(c.left);
        }
        if (!tmp.isEmpty()) ans.add(tmp);
   }
   return ans;
}