top button
Flag Notify
    Connect to us
      Site Registration

Site Registration

Is it possible to get the numbers in non-decreasing order by using Preorder traversal for any min heap? [CLOSED]

+3 votes
356 views
Is it possible to get the numbers in non-decreasing order by using Preorder traversal for any min heap? [CLOSED]
closed with the note: Reason provided in comment and it clarified.
posted Jul 26, 2016 by Shahsikant Dwivedi

Looking for an answer?  Promote on:
Facebook Share Button Twitter Share Button LinkedIn Share Button
If tree is not a BST then yes :) I hope I got the question correctly.
commented Jul 26, 2016 by Salil Agrawal
yes, sir you got it right.thanks, i was in bit of confusion
commented Jul 27, 2016 by Shahsikant Dwivedi

Similar Questions
+5 votes
Is it possible to construct BST by using Inorder Traversal?

I came to know that ,construction of BST is possible by using PreOrder and PostOrder traversal but is it possible to construct a BST using InOrder traversal , if not then why?

+4 votes
How to get preorder sequence from a post order sequence in a binary tree?

For ex : Given post order sequence 1 3 2 6 9 8 5
its pre order sequence is 5 2 1 3 8 6 9

...