In a binary tree, certain null entries are re- placed by special pointers which point to nodes higher in tree for efficiency. These special pointers are called

In a binary tree, certain null entries are re- placed by special point

1.	In a binary tree, certain null entries are re- placed by special pointers which point to nodes higher in tree for efficiency. These special pointers are called
A.	Leaf
B.	Branch
C.	Path
D.	Thread
Answer» E.

Discussion

No Comment Found

Related MCQs

What will be output if you will compile and execute the following c code? #includeint main(){double far* p,q;printf("%d",sizeof(p)+sizeof q); return 0; }
What will be output if you will compile and execute the following c code? #includeint main(){printf("%d",sizeof(5.2)); return 0;}
Consider an implementation of unsorted singly linked list. Suppose it has its representation with a head pointer only. Given the representation, which of the following operation can be implemented in O(1) time?i) Insertion at the front of the linked listii) Insertion at the end of the linked listiii) Deletion of the front node of the linked listiv) Deletion of the last node of the linked list
Consider an implementation of unsorted doubly linked list. Suppose it has its representation with a head pointer 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 listii) Insertion at the end of the linked listiii) Deletion of the front node of the linked listiv) Deletion of the end node of the linked list
What will be output if you will compile and execute the following c code? #include int main(){int array[]={10,20,30,40};printf("%d",-2[array]); return 0;}
Consider the following definition in c programming languagestruct node{int data;struct node * next;}typedef struct node NODE;NODE *ptr;Which of the following c code is used to create new node?
The memory address of fifth element of an array can be calculated by the formula
Each data item in a record may be a group item composed of sub-items; those items which are indecomposable are called
consider the function f defined here:struct item{int data;struct item * next;};int f (struct item *p){return((p==NULL) ||((p->next==NULL)||(p->datanext->data) && (p->next)));}For a given linked list p, the function f returns 1 if and only if
Each array declaration need not give, implicitly or explicitly, the information about the

In a binary tree, certain null entries are re- placed by special pointers which point to nodes higher in tree for efficiency. These special pointers are called

Discussion

No Comment Found

Related MCQs

Reply to Comment