Struct leetcode_prelude::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.

Note

I add Ord PartialOrd for sort Vec when testing Please don't rely on it

Fields

val: i32

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

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

Methods

impl TreeNode

pub fn new(val: i32) -> Self

Trait Implementations

impl PartialEq<TreeNode> for TreeNode

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

This method tests for self and other values to be equal, and is used by ==.

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

This method tests for !=.

impl Ord for TreeNode

fn cmp(&self, other: &TreeNode) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

Compares and returns the minimum of two values.

impl Eq for TreeNode

impl PartialOrd<TreeNode> for TreeNode

fn partial_cmp(&self, other: &TreeNode) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

This method tests less than (for self and other) and is used by the < operator.

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

This method tests less than or equal to (for self and other) and is used by the <= operator.

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

This method tests greater than (for self and other) and is used by the > operator.

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

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl Debug for TreeNode

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

Formats the value using the given formatter.