本文共 764 字，大约阅读时间需要 2 分钟。

/** * Definition for a binary tree node. * struct TreeNode { *     int val; *     TreeNode *left; *     TreeNode *right; *     TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {
   public:    void doit(TreeNode* now,vector
   
    & v){
           if(now->left != NULL) doit(now->left,v);        v.push_back(now->val);        if(now->right != NULL) doit(now->right,v);    }    vector
    
      getAllElements(TreeNode* root1, TreeNode* root2) {
           vector
     
       treeA;        vector
      
        treeB;        if(root1 != NULL) doit(root1,treeA);        if(root2 != NULL) doit(root2,treeB);        vector
       
         ans(treeA.size()+treeB.size(),0);        int a = 0;        int b = 0;        int loc = 0;        while(a
       
      
     
    
   

转载地址：http://ntgci.baihongyu.com/