algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-11-04 14:18:20 +08:00
Code Issues Packages Projects Releases Wiki Activity

feat: Add rust code in binary_tree.md (#759)

Browse Source 
* feat: Add binary_tree.md

* Update binary_tree.md

---------

Co-authored-by: Yudong Jin <krahets@163.com>
This commit is contained in:
lucas
2023-10-03 00:43:24 +08:00
committed by GitHub
parent d86cb0ee5d
commit 0e3d2ce4bb
1 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
docs/chapter_tree/binary_tree.md
View File

@ -58,7 +58,7 @@
Left *TreeNode Left *TreeNode
Right *TreeNode Right *TreeNode
} }
/* 节点初始化方法 */ /* 构造方法 */
func NewTreeNode(v int) *TreeNode { func NewTreeNode(v int) *TreeNode {
return &TreeNode{ return &TreeNode{
Left: nil, // 左子节点指针 Left: nil, // 左子节点指针
@ -134,7 +134,7 @@
use std::rc::Rc; use std::rc::Rc;
use std::cell::RefCell; use std::cell::RefCell;
/* 二叉树节点类型 */ /* 二叉树节点结构体 */
struct TreeNode { struct TreeNode {
val: i32, // 节点值 val: i32, // 节点值
left: Option<Rc<RefCell<TreeNode>>>, // 左子节点引用 left: Option<Rc<RefCell<TreeNode>>>, // 左子节点引用
@ -142,7 +142,7 @@
} }
impl TreeNode { impl TreeNode {
/* 二叉树节点构造方法 */ /* 构造方法 */
fn new(val: i32) -> Rc<RefCell<Self>> { fn new(val: i32) -> Rc<RefCell<Self>> {
Rc::new(RefCell::new(Self { Rc::new(RefCell::new(Self {
val, val,