Optimization

begeekmyfriend · begeekmyfriend · commit 3c1b10e68fae · 2017-09-16T11:12:47.000+08:00
Signed-off-by: begeekmyfriend &lt;begeekmyfriend@gmail.com&gt;
diff --git a/102_binary_tree_level_order_traversal/bst_bfs.c b/102_binary_tree_level_order_traversal/bst_bfs.c
@@ -167,7 +167,6 @@ static int** levelOrder(struct TreeNode* root, int** columnSizes, int* returnSiz
     if (root->right != NULL) {
         new = node_new(&free_list, root->right);
         list_add_tail(&new->link, &bfs_queue0);
-        (*columnSizes)[level]++;
     }
 
     results[level] = malloc(sizeof(int));

Original file line number	Diff line number	Diff line change
`@@ -167,7 +167,6 @@ static int** levelOrder(struct TreeNode* root, int** columnSizes, int* returnSiz`
`167`	`167`	`if (root->right != NULL) {`
`168`	`168`	`new = node_new(&free_list, root->right);`
`169`	`169`	`list_add_tail(&new->link, &bfs_queue0);`
`170`		`- (*columnSizes)[level]++;`
`171`	`170`	`}`
`172`	`171`
`173`	`172`	`results[level] = malloc(sizeof(int));`