When converting binary tree into extended binary tree, all the original nodes in binary tree are

Related MCQs

• 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
• Nodes that are not root and not leaf are called as internal nodes.
• The in order traversal of tree will yield a sorted listing of elements of tree in
• 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
• 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
• Which nodes contains a null pointer in a linked list?
• A sorting technique that guarantees that records with the same primary key occurs in the same order in the sorted list as in the original unsorted list is said to be