If we choose Prim's Algorithm for uniquely weighted spanning...

MCQ

If we choose Prim's Algorithm for uniquely weighted spanning tree instead of Kruskal's Algorithm, then

we'll get a different spanning tree.

we'll get the same spanning tree.

spanning will have less edges.

spanning will not cover all vertices.

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

Re-balancing of AVL tree costs

?(1)

?(log n)

?(n)

?(n2)

Discussion

MCQ

All possible spanning trees of graph G

have same number of edges and vertices.

have same number of edges and but not vertices.

have same number of vertices but not edges.

depends upon algorithm being used.

Discussion

MCQ

Is the below tree representation of 50,100,400,300,280 correct way to represent cartesian tree?

may be

can't say

Discussion

MCQ

Level of any node of a tree is

Height of its left subtree minus height of its right subtree

Height of its right subtree minus height of its left subtree

Its distance from the root

None of these

Discussion

MCQ

What is missing in this logic of finding a path in the tree for a given sum (i.e checking whether there will be a path from roots to leaf nodes with given sum)?

checkSum(struct bin-treenode *root , int sum) :
  if(root==null)
    return sum as 0
  else :
     leftover_sum=sum-root_node-->value
     //missing

code for having recursive calls to either only left tree or right trees or to both subtrees depending on their existence

code for having recursive calls to either only left tree or right trees

code for having recursive calls to either only left tree

code for having recursive calls to either only right trees

Discussion

Banking

Engineering

General

Medical

Question Discussion & Solution

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Data Structure Topics

Data Structure Basics

Abstract data types

Arrays

Lists

Stacks

Queues

Trees

Binary Trees

B Trees

Heaps

Hash based structures

Graphs

Mixed

Banking

Engineering

General

Medical

Question Discussion & Solution

report Report Error

forum Community Discussion

auto_awesome Similar Questions

report Report Error

report Report Error

report Report Error

report Report Error

report Report Error

category More Data Structure Topics

Data Structure Basics

Abstract data types

Arrays

Lists

Stacks

Queues

Trees

Binary Trees

B Trees

Heaps

Hash based structures

Graphs

Mixed

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Data Structure Topics