新子节点作为根节点的左子节点
(&mut self, key: T)
| 24 | |
| 25 | // 新子节点作为根节点的左子节点 |
| 26 | fn insert_left_tree(&mut self, key: T) { |
| 27 | if self.left.is_none() { |
| 28 | let node = BinaryTree::new(key); |
| 29 | self.left = Some(Box::new(node)); |
| 30 | } else { |
| 31 | let mut node = BinaryTree::new(key); |
| 32 | node.left = self.left.take(); |
| 33 | self.left = Some(Box::new(node)); |
| 34 | } |
| 35 | } |
| 36 | |
| 37 | // 新子节点作为根节点的右子节点 |
| 38 | fn insert_right_tree(&mut self, key: T) { |