-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy path103-BinaryTreeZigzagLevelOrderTraversal.cs
46 lines (37 loc) · 1.35 KB
/
103-BinaryTreeZigzagLevelOrderTraversal.cs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
//-----------------------------------------------------------------------------
// Runtime: 244ms
// Memory Usage: 30.3 MB
// Link: https://leetcode.com/submissions/detail/370019042/
//-----------------------------------------------------------------------------
using System.Collections.Generic;
namespace LeetCode
{
public class _103_BinaryTreeZigzagLevelOrderTraversal
{
private Queue<TreeNode> queue = new Queue<TreeNode>();
public IList<IList<int>> ZigzagLevelOrder(TreeNode root)
{
var results = new List<IList<int>>();
if (root == null) return results;
queue.Enqueue(root);
var leftToRight = true;
while (queue.Count > 0)
{
var levelSize = queue.Count;
var result = new int[levelSize];
for (int i = 0; i < levelSize; i++)
{
var node = queue.Dequeue();
result[leftToRight ? i : (levelSize - i - 1)] = node.val;
if (node.left != null)
queue.Enqueue(node.left);
if (node.right != null)
queue.Enqueue(node.right);
}
results.Add(result);
leftToRight = !leftToRight;
}
return results;
}
}
}