Homechevron_rightEngineeringchevron_rightComputer Sciencechevron_rightData Structurechevron_rightHow many minimum number of spanning trees, one can have from a given c...

How many minimum number of spanning trees, one can have from a given c...

  • Q. How many minimum number of spanning trees, one can have from a given connected graph with N nodes is having different weights for the edges.
  • filter_dramaExplanation
    Answer is : B
    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. What are the operations that could be performed in O(logn) time complexity by red-black tree?
  • filter_dramaExplanation
    Answer is : A
    None.
  • 2. What is an AVL tree?
  • filter_dramaExplanation
    Answer is : A
    None.
  • 3. Maximum number of nodes in a binary tree with height k, where root is height 0, is
  • filter_dramaExplanation
    Answer is : B
    None.
  • 4. Select the code snippet which performs in-order traversal.

    a)

public void inorder(Tree root)
{
 System.out.println(root.data);
 inorder(root.left);
 inorder(root.right);
}

b)

public void inorder(Tree root)
{
 inorder(root.left);
 System.out.println(root.data);
 inorder(root.right);
}

c)

public void inorder(Tree root)
{
 System.out.println(root.data);
 inorder(root.right);
 inorder(root.left);
}

d) None of the mentioned
  • filter_dramaExplanation
    Answer is : B
    None.
  • 5. To obtain a prefix expression, which of the tree traversals is used?
  • filter_dramaExplanation
    Answer is : B
    None.

Data StructureTopics

leaderboardLeaderboard
  • Rahul Kumar

    191 Points

  • VIKRAM JEET

    54 Points

  • GEETHIKA CHOWDARY

    53 Points

  • sunita saini

    52 Points

  • Zain

    49 Points