Practice
Resources
Contests
Online IDE
New
Free Mock
Events New Scaler
Practice
Improve your coding skills with our resources
Contests
Compete in popular contests with top coders
logo
Events
Attend free live masterclass hosted by top tech professionals
New
Scaler
Explore Offerings by SCALER

Serialize Binary Tree Migrated

Problem Description

Given the root node of a Binary Tree denoted by A. You have to Serialize the given Binary Tree in the described format.

Serialize means encode it into a integer array denoting the Level Order Traversal of the given Binary Tree.

NOTE:

  • In the array, the NULL/None child is denoted by -1.
  • For more clarification check the Example Input.


  • Problem Constraints

    1 <= number of nodes <= 105



    Input Format

    Only argument is a A denoting the root node of a Binary Tree.



    Output Format

    Return an integer array denoting the Level Order Traversal of the given Binary Tree.



    Example Input

    Input 1:

               1
             /   \
            2     3
           / \
          4   5
    

    Input 2:

                1
              /   \
             2     3
            / \     \
           4   5     6
    



    Example Output

    Output 1:

     [1, 2, 3, 4, 5, -1, -1, -1, -1, -1, -1]

    Output 2:

     [1, 2, 3, 4, 5, -1, 6, -1, -1, -1, -1, -1, -1]



    Example Explanation

    Explanation 1:

     The Level Order Traversal of the given tree will be [1, 2, 3, 4, 5 , -1, -1, -1, -1, -1, -1].
     Since 3, 4 and 5 each has both NULL child we had represented that using -1.

    Explanation 2:

     The Level Order Traversal of the given tree will be [1, 2, 3, 4, 5, -1, 6, -1, -1, -1, -1, -1, -1].
     Since 3 has left child as NULL while 4 and 5 each has both NULL child.



    NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a question? Checkout Sample Codes for more details.
    Start solving Serialize Binary Tree Migrated on Interview Code Editor
    Hints
    • Hint 1
    • Solution Approach
    • Complete Solution

    Discussion


    Loading...
    Click here to start solving coding interview questions
    Free Mock Assessment
    Fill up the details for personalised experience.
    All fields are mandatory
    Current Employer *
    Enter company name *
    Graduation Year *
    Select an option *
    1993
    1994
    1995
    1996
    1997
    1998
    1999
    2000
    2001
    2002
    2003
    2004
    2005
    2006
    2007
    2008
    2009
    2010
    2011
    2012
    2013
    2014
    2015
    2016
    2017
    2018
    2019
    2020
    2021
    2022
    2023
    2024
    2025
    2026
    2027
    2028
    Phone Number *
    OTP will be sent to this number for verification
    +1 *
    +1
    Change Number
    Phone Number *
    OTP will be sent to this number for verification
    +1 *
    +1
    Change Number
    Graduation Year *
    Graduation Year *
    1993
    1994
    1995
    1996
    1997
    1998
    1999
    2000
    2001
    2002
    2003
    2004
    2005
    2006
    2007
    2008
    2009
    2010
    2011
    2012
    2013
    2014
    2015
    2016
    2017
    2018
    2019
    2020
    2021
    2022
    2023
    2024
    2025
    2026
    2027
    2028
    *Enter the expected year of graduation if you're student
    Current Employer *
    Company Name *
    Please verify your phone number
    Edit
    Resend OTP
    By clicking on Start Test, I agree to be contacted by Scaler in the future.
    Already have an account? Log in
    Free Mock Assessment
    Instructions from Interviewbit
    Start Test