The Gateway to Computer Science Excellence
0 votes

Suppose a binary tree has only three nodes A, B and C and you are given that the post-order traversal for the tree is B-A-C. The exact preorder traversal for the tree is.

  1. C-A-B
  2. A-B-C
  3. C-B-A
  4. A definite pre-order traversal cannot be determined from the information given
closed with the note: I got it
in DS by (21 points)
closed by | 181 views

To say exact preorder for a given Post order may not be possible  above example explains it

Hmm right
Thank you, got it

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,666 questions
56,131 answers
93,303 users