Binary tree help please

[sim18]

Hi, If I get given an array say [5,4,10,8,21,12,9,45,13,11,28]

I have to draw the complete binary tree for that. How would I know what goes at the top of the tree or where to start?

I have looked around and have found you go from left to right, could somebody check my answer please?

 
   5
  / \
4    10
     /  \
   8     21
    \    /  \
     9  12  45
              /
            13
            /  \
           11  28

[wdh321]

It depends if you want to create a Binary Tree or a Binary Search Tree. The main difference between the two is with the BST, nodes to the left are greater than those to the right. This allows the tree to be efficiently searched. A BST can can have many different variations, from a completely balanced tree to a completely unbalanced tree depending on the root node value.

[sim18]

I'm not sure it just says to draw that complete binary tree from the array. I then have to heapify the tree into a maximum heap. (I know how to do this) Then I will be inserting and removing nodes into the tree.

I am just checking if the tree is correct to begin with.

Thank you