1305. 两棵二叉搜索树中的所有元素
给你 root1 和 root2 这两棵二叉搜索树。请你返回一个列表,其中包含 两棵树 中的所有整数并按 升序 排序。
.输入:root1 = [2,1,4], root2 = [1,0,3]
输出:[0,1,1,2,3,4]
输入:root1 = [1,null,8], root2 = [8,1]
输出:[1,1,8,8]
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
void inprint(TreeNode *T,vector<int>&v)
{
if(!T)return ;
inprint(T->left,v);
v.push_back(T->val);
inprint(T->right,v);
}
public:
vector<int> getAllElements(TreeNode* root1, TreeNode* root2) {
vector<int>v1,v2,res;
inprint(root1,v1),inprint(root2,v2);
int l=0,r=0;
if(v1.size()==0)res=v2;
else if(v2.size()==0)res=v1;
else
{
int l=0,r=0;
while(l<v1.size()&&r<v2.size())
{
if(v1[l]<=v2[r])res.push_back(v1[l++]);
else res.push_back(v2[r++]);
}
while(l<v1.size())res.push_back(v1[l++]);
while(r<v2.size())res.push_back(v2[r++]);
}
return res;
}
};