Homechevron_rightEngineeringchevron_rightComputer Sciencechevron_rightData Structurechevron_rightHow do you determine the cost of a spanning tree?

How do you determine the cost of a spanning tree?

  • Q. How do you determine the cost of a spanning tree?
  • filter_dramaExplanation
    Answer is : A
    None.

Discussion

    No one started the discussion yet. Break the ice and start the conversation.
    Please Login to be part of the discussion.

Similar Questions

  • 1. How many nodes in a tree have no ancestors.
  • filter_dramaExplanation
    Answer is : B
    None.
  • 2. What is the below pseudo code trying to do, where pt is a node pointer and root pointer.

    redblack(Node root, Node pt) :
    if (root == NULL)
       return pt
 
    if (pt.data < root.data)
    {
        root.left  =   redblack(root.left, pt);
        root.left.parent = root
    }
    else if (pt.data > root.data)
    {
        root.right = redblackt(root.right, pt)
        root.right.parent = root
    }
   return root
  • filter_dramaExplanation
    Answer is : A
    None.
  • 3. What is the space complexity of the in-order traversal in the recursive fashion? (d is the tree depth and n is the number of nodes)
  • filter_dramaExplanation
    Answer is : D
    None.
  • 4. The following formula is of :

    left_subtree (keys) ? node (key) ? right_subtree (keys)
  • filter_dramaExplanation
    Answer is : C
    None.
  • 5. What is the search complexity in direct addressing?
  • filter_dramaExplanation
    Answer is : D
    None.

Data StructureTopics

leaderboardLeaderboard
  • Rahul Kumar

    191 Points

  • VIKRAM JEET

    54 Points

  • GEETHIKA CHOWDARY

    53 Points

  • sunita saini

    52 Points

  • Zain

    49 Points