LeetCode 1305. 两棵二叉搜索树中的所有元素

原题目：https://leetcode-cn.com/problems/all-elements-in-two-binary-search-trees/

 

思路：

中序遍历两棵树，然后合并两个排好序的数组

 

代码：

/**
 * 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 inorder(TreeNode* root, vector<int> &ans){
        if(root==NULL) return;
        inorder(root->left,ans);
        ans.push_back(root->val);
        inorder(root->right,ans);
    }
    vector<int> getAllElements(TreeNode* root1, TreeNode* root2) {
        vector<int> ans1,ans2;
        inorder(root1,ans1);
        inorder(root2,ans2);

        int index1=0,index2=0;
        vector<int> ans;
        while(index1<ans1.size()&&index2<ans2.size()){
            if(ans1[index1] < ans2[index2]) ans.push_back(ans1[index1++]);
            else ans.push_back(ans2[index2++]);
        }
        while(index1<ans1.size()) ans.push_back(ans1[index1++]);
        while(index2<ans2.size()) ans.push_back(ans2[index2++]);

        return ans;
    }
};