A path P of length n from a node u to a node v is defined as a sequence of _________ nodes.

Related MCQs

• Any node is the path from the root to the node is called
• The length of the path is the number of_____________ on the path.
• If we implement heap as min-heap, deleting root node (value 1)from the heap. What would be the value of root node after second iteration if leaf node (value 100) is chosen to replace the root at start.
• A graph is a collection of nodes, called ………. And line segments called arcs or ……….. that connect pair of nodes.
• In a full binary tree if number of internal nodes is I, then number of nodes N are?
• The binary tree that has n leaf nodes. The number of nodes of degree 2 in this tree is
• 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.
• What is the possible number of binary trees that can be created with 3 nodes, giving the sequence N, M, L when traversed in post-order.
• A …………… is an acyclic digraph, which has only one node with indegree 0, and other nodes have in-degree 1.
• A linear list in which each node has pointers to point to the predecessor and successors nodes is called as ..