Write a function for zigzag traversal in a binary tree

Write a function for zigzag traversal in a binary tree

题目类型: 技术面试题

这是一道技术面试题，常见于澳洲IT公司面试中。

难度: medium

标签: interviewbit, data-structure, topic-specific, data-structures, algorithms

参考答案摘要

Input: Output: [1, 3, 2, 4, 5, 6, 8, 7] Explanation: Zigzag Traversal first iterates the given level of the tree from left to right and then the next level as the right to the level. // Tree Node stru...

本题提供 STAR 原则详细解答和技术解析，登录匠人学院学习中心即可查看完整答案。