A …………… is an acyclic digraph, which has only one node with indegree 0, and other nodes have in-degree 1.

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 directed graph is ………………. if there is a path from each vertex to every other vertex in the digraph.
• A linear list in which each node has pointers to point to the predecessor and successors nodes is called as ..
• A linear list in which each node has pointers to point to the predecessor and successors nodes is called as
• A graph is a collection of nodes, called ………. And line segments called arcs or ……….. that connect pair of nodes.
• Any node is the path from the root to the node is called
• node.next -> node.next.next; will make
• What is the functionality of the following code? Choose the most appropriate answer. public int function() { if(head == null) return Integer.MIN_VALUE; int var; Node temp = head; Node cur; while(temp.getNext() != head) { cur = temp; temp = temp.getNext(); } if(temp == head) { var = head.getItem(); head = null; return var; } var = temp.getItem(); cur.setNext(head); return var; }
• If in a linked list address of first node is 1020 then what will be the address of node at 5th position ?
• If two trees have same structure and but different node content, then they are called ___