Scribd Logo
Upload

Welcome to Scribd!

  • The Tree Has 3levels

    Uploaded by

    rukhsar arshad
    4 views3 pages
    Rukhsar from VU is submitting assignment 1 for course cs607p. The document discusses using breadth-first search (BFS) to find the shortest path or nearest solution in a tree with 11 nodes across 3 levels. It provides the BFS traversal path from the root node labeled 1 to the target node labeled 11, going through nodes 1->2->7->8->3->9->6->4->12->15->10->11. It also shows the undirected structure of another tree with node 4 at the root.

    Original Description:

    Original Title

    jks

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    Rukhsar from VU is submitting assignment 1 for course cs607p. The document discusses using breadth-first search (BFS) to find the shortest path or nearest solution in a tree with 11 nodes across 3 levels. It provides the BFS traversal path from the root node labeled 1 to the target node labeled 11, going through nodes 1->2->7->8->3->9->6->4->12->15->10->11. It also shows the undirected structure of another tree with node 4 at the root.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    4 views3 pages

    The Tree Has 3levels

    Uploaded by

    rukhsar arshad
    Rukhsar from VU is submitting assignment 1 for course cs607p. The document discusses using breadth-first search (BFS) to find the shortest path or nearest solution in a tree with 11 nodes across 3 levels. It provides the BFS traversal path from the root node labeled 1 to the target node labeled 11, going through nodes 1->2->7->8->3->9->6->4->12->15->10->11. It also shows the undirected structure of another tree with node 4 at the root.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    of 3

    Name Rukhsar

    VU Code bc210426177
    Course cs607p Assignment no 1

    Solution No 1

    Reason for using BFs


    To find the shortest path or the nearest solution

    Number of nodes in operations


    The given tree contains 11 nodes
    Level of tree
    The tree has 3levels

    Path of tree
    The BFs traversal path with a height of 4 will be 1->2->7->8-
    >3->9->6->4->12->15->10->11 (Targeted node)

    Last node/ Targeted node


    The targeted node is labeled as 11in the tree
    Here is the structure

    7
    2

    8 3
    6 9

    12 4 5 10

    11
    Solution NO 2

    Undirect structure

    5
    1

    3
    7

    You might also like