title: Level order binary tree insert with 0-children subtrees
body: <p>I'm trying to create algorithm that inserts values to binary tree in level order but when the value is 0 then the node has no children</p>
  <p>Example:</p>
  <pre><code>Elements: [7,6,4,3,0,1,1,2,0,0,0,0,0,5,0,0]
  How values in tree would be placed:
           7
          / \
         6   4
        /   / \
       3   0   1
      /  \    / \
     1    2  0   0
    / \  / \
   0  0 0   5
           / \
          0   0
  </code></pre>
  <p>I don't know how to transform BFS algorithm to make it &quot;dodge&quot; inserting in 0-value nodes.</p>