When in order traversing a tree resulted E A C K F H D B G; the preorder traversal would return

Related MCQs

• The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal
• The in order traversal of tree will yield a sorted listing of elements of tree in
• When converting binary tree into extended binary tree, all the original nodes in binary tree are
• 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
• Insertion b) Deletion c) Retrieval d) Traversal
• In doubly linked lists, traversal can be performed?
• What will be output if you will compile and execute the following c code? #include<stdio.h> int * call(); int main(){ int *ptr; ptr=call(); printf("%d",*ptr); return 0; } int * call(){ int a=25; a++; return &a; }
• If the characters 'D', 'C', 'B', 'A' are placed in a queue (in that order), and then removed one at a time, in what order will they be removed?
• In strictly binary tree, the out-degree of every node is either o or 2.
• A binary tree whose every node has either zero or two children is called