combine---two-binary-trees-

  This is a small program to create indexs for two binary trees and combine them to a new 003 * index tree and output the new tree,the second tree only has the left child tree then 004 * if the first tree has no left child tree,insert the second tree into the first tree as 005 * its left child and if the first tree has the left child tree,then insert the first tree 006 * into the second tree as its left child. (This is a small program to create indexs for two binary trees and combine them to a new 003* index tree and output the new tree, the second tree only has the left child tree then 004* if the first tree has no left child tree, insert the second tree into the first tree as 005* its left child and if the first tree has the left child tree, then insert the first tree 006* into the second tree as its left child.)