-
[LeetCode] Populating Next Right Pointers in Each Node알고리즘 2019. 12. 4. 16:35
문제
You are given a perfect binary tree where all leaves are on the same level, and every parent has two children. The binary tree has the following definition:struct Node { int val; Node *left; Node *right; Node *next; }
Populate each next pointer to point to its next right node. If there is no next right node, the next pointer should be set to NULL.
Initially, all next pointers are set to NULL.
Follow up:
- You may only use constant extra space.
- Recursive approach is fine, you may assume implicit stack space does not count as extra space for this problem.
Approach
이 문제에서 했던 접근방식에 착안해 BFS로 풀었다.
Code
https://github.com/chi3236/algorithm/blob/master/LeetCode_PopulatingNextRightPointersInEachNode.cpp
'알고리즘' 카테고리의 다른 글
[LeetCode] Best Time to Buy and Sell Stock (0) 2019.12.04 [LeetCode] Pascal's Triangle (0) 2019.12.04 [LeetCode] Convert Sorted Array to Binary Search Tree (0) 2019.12.04 [LeetCode] Construct Binary Tree from Preorder and Inorder Traversal (0) 2019.12.04 [LeetCode] Maximum Depth of Binary Tree (0) 2019.12.03