Register

Self Made

445 views
2 votes
2 votes
Given a tree of 3 nodes A,B and C, the Inorder Traversal is CAB and the Preorder Traversal is ABC. What is the structure of the tree?
User Avatar

1 Answer

Best answer
3 votes
3 votes
You do damage to property of preorder and inorder

preoder : Root Left Right

Inorder : Left Root Right

you gave

CAB as inorder means A is root then C is left and then B is right

So how in preorder how can  B be a left child.

So here you are take preorder of one tree and inorder of another tree. Hope u got it
• selected by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
Samujjal Das asked Dec 2, 2016
354 views
Self Made
Suppose we are given a set of elements to be inserted in a Max Heap. What is the approach to follow from the following? 1.Insert an element, apply HEAPIFY, insert the next element, again apply HEAPIFY, and so on. 2. Insert all the elements and once done, apply BUILD-MAX-HEAP. What is the correct approach?
Suppose we are given a set of elements to be inserted in a Max Heap. What is the approach to follow from the following?1.Insert an element, apply HEAPIFY, insert the next...
User Avatar
1 votes
1 votes
2 answers
2
Jithin Jayan asked Jul 23, 2016
651 views
Self Made
Given an unsorted Array of n elements and asked to find the Largest element of that array. Can we use Max-Heapify Procedure to find the Largest element in that array in O(logn) time ?
Given an unsorted Array of n elements and asked to find the Largest element of that array. Can we use Max-Heapify Procedure to find the Largest element in that array in O...
User Avatar
0 votes
0 votes
3 answers
3
Jithin Jayan asked Jul 13, 2016
490 views
Self Made
Given only pre-order of a Binary Search Tree, Can we identify a Binary Search Tree Uniquely?
Given only pre-order of a Binary Search Tree, Can we identify a Binary Search Tree Uniquely?
User Avatar
Link Copied!