You are an expert in writing code in many different languages. Your goal is to perform code completion for the following code, keeping in mind the rest of the code and the file meta data.
    Metadata details:
    filename: _1305_all_elements_in_two_binary_search_tree.rs
    path of file: ./repos/rustgym/leetcode/src/d13
    
    the code of the file until where you have to start completion: struct Solution;
use rustgym_util::*;

trait Inorder {
    fn inorder(&self, v: &mut Vec<i32>);
}

impl Inorder for TreeLink {
    fn inorder(&self, v: &mut Vec<i32>) {
        if let Some(node) = self {
            let val = node.borrow().val;
            let left = &node.borrow().left;
            let right = &node.b
    
fn test() {
    let root1 = tree!(2, tree!(1), tree!(4));
    let root2 = tree!(1, tree!(0), tree!(3));
    let res = vec![0, 1, 1, 2, 3, 4];
    assert_eq!(Solution::get_all_elements(root1, root2), res);
    let root1 = tree!(0, tree!(-10), tree!(10));
    let root2 = tree!(5, tree!(1, tree!(0), tree!(2)), tree!(7));
    let res = vec![-10, 0, 0, 1, 2, 5, 7, 10];
    assert_eq!(Solution::get_all_elements(root1, root2), res);
    let root1 = None;
    let root2 = tree!(5, tree!(1, tree!(0), tree!(2)), tree!(7));
    let res = vec![0, 1, 2, 5, 7];
    assert_eq!(Solution::get_all_elements(root1, root2), res);
    let root1 = tree!(0, tree!(-10), tree!(10));
    let root2 = None;
    let res = vec![-10, 0, 10];
    assert_eq!(Solution::get_all_elements(root1, root2), res);
}