The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal

Related MCQs

• When converting binary tree into extended binary tree, all the original nodes in binary tree are
• The in order traversal of tree will yield a sorted listing of elements of tree in
• When in order traversing a tree resulted E A C K F H D B G; the preorder traversal would return
• 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 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
• Insertion b) Deletion c) Retrieval d) Traversal
• In doubly linked lists, traversal can be performed?