Struct TreeNode

pub struct TreeNode {
    pub val: i32,
    pub left: Option<Rc<RefCell<TreeNode>>>,
    pub right: Option<Rc<RefCell<TreeNode>>>,
}

Definition for a binary tree node.

Fields

val: i32

The value stored at this node

left: Option<Rc<RefCell<TreeNode>>>

Link to the left child if one exists

right: Option<Rc<RefCell<TreeNode>>>

Link to the right child if one exists

Implementations

impl TreeNode

pub const fn new(val: i32) -> Self

Creates a new TreeNode with no children and the value passed

Trait Implementations

impl Debug for TreeNode

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl PartialEq for TreeNode

fn eq(&self, other: &TreeNode) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for TreeNode

impl StructuralPartialEq for TreeNode