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

Related MCQs

• When converting binary tree into extended binary tree, all the original nodes in binary tree are
• 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->data<=p->next->data) && (p->next))); } For a given linked list p, the function f returns 1 if and only if
• Which nodes contains a null pointer in a linked list?
• Nodes that are not root and not leaf are called as internal nodes.
• A binary tree whose every node has either zero or two children is called
• What additional requirement is placed on an array, so that binary search may be used to locate an entry?
• In strictly binary tree, the out-degree of every node is either o or 2.
• The depth of a complete binary tree is given by
• When representing any algebraic expression E the following uses only binary operations in a 2-tree
• The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal