按之形顺序打印二叉树

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).java For example: Given binary

>>阅读原文<<