Any node is the path from the root to the node is called

Related MCQs

• 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 path P of length n from a node u to a node v is defined as a sequence of _________ nodes.
• In a directed tree any node which has out degree 0 is called a terminal node or__________.
• The number of edges from the root to the node is called of the tree.
• B-tree of order n is a order-n multiway tree in which each non-root node contains
• The length of the path is the number of_____________ on the path.
• A _________is a linked list which always contains a special node called the header node, at the beginning of the list.
• 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 ?