Scribd Logo
Upload

Welcome to Scribd!

  • Spring 2011 - CS301 - 2 - SOL

    Uploaded by

    samzkhan
    14 views3 pages
    The document provides instructions for an assignment on data structures involving binary search trees (BSTs). It asks students to: 1) Construct a BST from a given sequence of numbers; 2) Perform in-order, pre-order, and post-order traversals of the tree; and 3) Delete the number 15 from the constructed BST. It also provides the expected outputs for the traversals and describes how to apply the second deletion case since 15 has only one subtree.

    Original Description:

    Original Title

    Spring 2011_CS301_2_SOL

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOC, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document provides instructions for an assignment on data structures involving binary search trees (BSTs). It asks students to: 1) Construct a BST from a given sequence of numbers; 2) Perform in-order, pre-order, and post-order traversals of the tree; and 3) Delete the number 15 from the constructed BST. It also provides the expected outputs for the traversals and describes how to apply the second deletion case since 15 has only one subtree.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as doc, pdf, or txt
    14 views3 pages

    Spring 2011 - CS301 - 2 - SOL

    Uploaded by

    samzkhan
    The document provides instructions for an assignment on data structures involving binary search trees (BSTs). It asks students to: 1) Construct a BST from a given sequence of numbers; 2) Perform in-order, pre-order, and post-order traversals of the tree; and 3) Delete the number 15 from the constructed BST. It also provides the expected outputs for the traversals and describes how to apply the second deletion case since 15 has only one subtree.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as doc, pdf, or txt
    of 3

    Solution to Assignment No.

    02
    Total Marks: 20
    SEMESTER Spring 2011
    CS301- Data Structures Due Date:
    03/05/2011

    Marks: 20

    Consider the following sequence of numbers: [ 20, 25, 3, 4, 14, 15, 18, 12, 9, 2, 16, 19,
    17 ]
     Construct Binary Search Tree (BST) [8
    marks]
     Perform In-order, Pre-order and Post-order traversal [6 marks]

    In-order:
    2, 3, 4, 9, 12, 14, 15, 16, 17, 18, 19, 20, 25

    Pre-order:
    20, 3, 2, 4, 14, 12, 9, 15, 18, 16, 17, 19, 25

    Post-order:
    2, 9, 12, 17, 16, 19, 18, 15, 14, 4, 3, 25, 20
     Delete 15 from the above constructed BST [6 marks]

    As 15 has only one sub-tree, that is right sub-tree, so we will apply 2nd case of deletion.
    Lectures Covered: This assignment covers Lecture # 12-16

    You might also like