As an example, I&#39;ve the following b-tree model with each node containing tag/value pairs.  The tree indicates precedence (or priority), with the root being highest, down to the leaves as lowest (but this is application specific).  I want to merge a new tree section into the parent, with the new section containing potentially common tag/value pairs all the way down to the node just above a leaf node (a completely duplicate new tree section would just not be merged).  E.g.<br>

<br>Existing tree (tag,value) pairs indicated:<br>                   A,0<br>     ,----------,----|--------,<br>   B,1      B,2         B,3<br>          ,------|------,<br>         C,1         C,2<br><br>New tree to merge:<br>

                   A,0<br>                     |<br>                   B,3<br>
              ,------|------,<br>
            C,1         C,2<br> <br>Final merged tree:<br>                   A,0<br>     ,----------,----|--------------,<br>   B,1      B,2               B,3<br>
          ,------|------,      ,-----------,<br>
         C,1         C,2  C,1       C,2<br>
<br>Question: is there a boost solution to this b-tree merge, and if not any suggestions?  Thanks.<br>