tree traversal

Question

Consider the following min-heap tree data

Inorder;- 110,100,120,60,90,70,80,10,140,130,150,20,50,

Postorder??

Answer 1

In min heap root node must be minimum from left and right child.

Comments

thanks