Scribd Logo
Upload

Welcome to Scribd!

  • Practice - Binary Tree Reconstruction - 2

    Uploaded by

    dasmesh
    8 views1 page
    A binary tree can be reconstructed from an inorder and preorder traversal list by using the preorder list to determine the root node, splitting the inorder list at the root value into left and right subtree lists, and recursively rebuilding the left and right subtrees. The root node of the tree from the given lists is 10, with left and right subtrees of [4,7,2] and [3,5,6,1] respectively.

    Original Description:

    175

    Original Title

    Practice - Binary Tree Reconstruction_dc12798401c5dc4fca918435ea9a1e05 2

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    A binary tree can be reconstructed from an inorder and preorder traversal list by using the preorder list to determine the root node, splitting the inorder list at the root value into left and right subtree lists, and recursively rebuilding the left and right subtrees. The root node of the tree from the given lists is 10, with left and right subtrees of [4,7,2] and [3,5,6,1] respectively.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    8 views1 page

    Practice - Binary Tree Reconstruction - 2

    Uploaded by

    dasmesh
    A binary tree can be reconstructed from an inorder and preorder traversal list by using the preorder list to determine the root node, splitting the inorder list at the root value into left and right subtree lists, and recursively rebuilding the left and right subtrees. The root node of the tree from the given lists is 10, with left and right subtrees of [4,7,2] and [3,5,6,1] respectively.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    Example of how a binary tree is reconstructed, using the following traversal lists:

    inorder = [3,2,4,1,5]
    preorder = [1,2,3,4,5]

    Draw a diagram showing the steps to rebuild a binary tree. Use the following lists:
    inorder = [4,7,2,10,3,5,6,1]
    preorder = [10,7,4,2,6,3,5,1]

    You might also like