The maximum number of nodes in a tree for which post-order and pre-order traversals may be equal is

Related MCQs

• A binary tree in which all its levels except the last, have maximum numbers of nodes, and all the nodes in the last level have only one child it will be its left child. Name the tree.
• The pre-order and in-order are traversals of a binary tree are T M L N P O Q and L M N T O P Q. Which of following is post-order traversal of the tree?
• The binary tree that has n leaf nodes. The number of nodes of degree 2 in this tree is
• Which of the following pair’s traversals on a binary tree can build the tree uniquely?
• Find the postorder traversal of the binary tree shown below.
• When converting binary tree into extended binary tree, all the original nodes in binary tree are___________.
• In a directed tree if the ordering of the nodes at each level is prescribed then such a tree is called_______ tree.
• In a full binary tree if number of internal nodes is I, then number of nodes N are?
• Which of the following properties are obeyed by all three tree – traversals?
• To obtain a prefix expression, which of the tree traversals is used?