A graph is a tree if and only if graph is

Related Questions

• A binary tree in which all its levels except the last, have maximum numbers of nodes, and all the nodes in the last level have only one child it will be its left child. Name the tree.
• A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called ……
• The property of binary tree is
• …………………. Is a directed tree in which outdegree of each node is less than or equal to two.
• To perform level-order traversal on a binary tree, which of the following data structure will be required?
• A graph is said to be ……………… if the vertices can be split into two sets V1 and V2 such there are no edges between two vertices of V1 or two vertices of V2.
• A graph is a collection of nodes, called ………. And line segments called arcs or ……….. that connect pair of nodes.
• Which data structure is used in breadth first search of a graph to hold nodes?
• A directed graph is ………………. if there is a path from each vertex to every other vertex in the digraph.
• A ……….. is a graph that has weights of costs associated with its edges.