rust leetcode 111 二叉树最小深度

    pub fn min_depth(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
        fn m_depth(root: &Option<Rc<RefCell<TreeNode>>>) -> i32 {
            if let Some(node) = root {
                let r1 = m_depth(&node.borrow().left);
                let r2 = m_depth(&node.borrow().right);
                return 1 + if r1 == 0 { r2 } else if r2 == 0 { r1 } else { min(r1, r2) };
            }
            return 0;
        }
        return m_depth(&root);
    }