…………………. Is a directed tree in which outdegree of each node is less than or equal to two.

Related Questions

• 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 ?
• 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.
• Each node in a linked list has two pairs of ………….. and ……………….
• Each Node contain minimum two fields one field called data field to store data. Another field is of type _________.
• 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