二叉查找树定义
| 6 | |
| 7 | // 二叉查找树定义 |
| 8 | struct BST<T,U> { |
| 9 | key: Option<T>, |
| 10 | val: Option<U>, |
| 11 | left: Link<T,U>, |
| 12 | right: Link<T,U>, |
| 13 | } |
| 14 | |
| 15 | impl<T,U> BST<T,U> |
| 16 | where T: Clone + Ord + Debug, |
nothing calls this directly
no outgoing calls
no test coverage detected