Problem Challenge 1

Name: Grokking the Coding Interview: Patterns for Coding Questions
Author: Design Gurus

We'll cover the following

- - Connect All Level Order Siblings (medium)
- - Try it yourself

Connect All Level Order Siblings (medium) #

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.

Try it yourself #

Try solving this question here:

Java

Python3

C++

from __future__ import print_function
from collections import deque
 
 
class TreeNode:
  def __init__(self, val):
    self.val = val
    self.left, self.right, self.next = None, None, None
 
  # tree traversal using 'next' pointer
  def print_tree(self):
    print("Traversal using 'next' pointer: ", end='')
    current = self
    while current:
      print(str(current.val) + " ", end='')
      current = current.next
 
 
def connect_all_siblings(root):
  # TODO: Write your code here
  return
 
 
def main():
  root = TreeNode(12)
  root.left = TreeNode(7)
  root.right = TreeNode(1)
  root.left.left = TreeNode(9)
  root.right.left = TreeNode(10)
  root.right.right = TreeNode(5)
  connect_all_siblings(root)
  root.print_tree()
 
 
main()
 

Output

0.466s

Traversal using 'next' pointer: 12

Mark as Completed

← Back

Connect Level Order Siblings (medium)

Solution Review: Problem Challenge 1