In a Heap tree values in a node is greater than

Related MCQs

• Consider the following definition in c programming language struct node { int data; struct node * next; } typedef struct node NODE; NODE *ptr; Which of the following c code is used to create new node?
• When converting binary tree into extended binary tree, all the original nodes in binary tree are
• A node is child node if out degree is one.
• Each node in a linear list contains an item called _______ which points to the next node in the list.
• In a ________ linked list, the last node's link field points to the first node of the list.
• The second part of the node, is called _______ field, and contains the address of the next node in the list.
• A ________ linked list is a linked list which always contains a special node, called the header node.
• Select the set of instructions to insert a node pointed by q after a node pointed by p
• Each node in a linear list contains an item called____which points to the next node in the list.
• Consider an implementation of unsorted singly linked list. Suppose it has its representation with a head and tail pointer. Given the representation, which of the following operation can be implemented in O(1) time? i) Insertion at the front of the linked list ii) Insertion at the end of the linked list iii) Deletion of the front node of the linked list iv) Deletion of the last node of the linked lis