simple c++ code using inorder traversal and sort function..
  void inorder(TreeNode* rt,vector<int>&v)
    {
        if(rt==NULL) return;
        inorder(rt->left,v);
        v.push_back(rt->val);
        inorder(rt->right,v);
    }
    vector<int> getAllElements(TreeNode* root1, TreeNode* root2) {
        vector<int> ans;
        inorder(root1,ans);
        inorder(root2,ans);
        sort(ans.begin(),ans.end());
        return ans;
    }
Comments (0)