[LeetCode] Binary Tree Level Order Traversal in Objective C

 typedef struct {
int value;
struct TreeNode *left;
struct TreeNode *right;
} TreeNode;

-(NSMutableArray *)levelOrder:(TreeNode *)treeNode
{
NSMutableArray *levelOrderArray = [NSMutableArray array];
if (treeNode == nil) return levelOrderArray;

NSMutableArray *queue = [NSMutableArray array];
[queue addObject: treeNode];
while (queue.count != 0) {
NSMutableArray *eachLevelArray = [NSMutableArray array];
int size = queue.count;
for (int i = 0; i<size; i++) {
treeNode *node = [queue firstObject];
[queue removeObjectAtIndex: 0];
[eachLevelArray addObject: node];
if (node.left) {
[queue addObject: node.left];
}
if (node.right) {
[queue addObject: node.right];
}
}
[levelOrderArray addObject: eachLevelArray];
}
return levelOrderArray;
}
One clap, two clap, three clap, forty?

By clapping more or less, you can signal to us which stories really stand out.