7.9 Problem Challenge 1 - Connect All Level Order Siblings (medium)
Previous7.8 Connect Level Order Siblings (medium)Next7.10 Problem Challenge 2 - Right View of a Binary Tree (easy)
Last updated
Was this helpful?
Last updated
Was this helpful?
Given a binary tree, connect each node with its level order successor. The last node of each level should point to the first node of the next level.
Example 1:
Example 2:
The time complexity of the above algorithm is O(N), where āNā is the total number of nodes in the tree. This is due to the fact that we traverse each node once.
The space complexity of the above algorithm will be O(N), which is required for the queue. Since we can have a maximum of N/2 nodes at any level (this could happen only at the lowest level), therefore we will need O(N) space to store them in the queue.
Time complexity
Space complexity