Struct leetcode_trees_rs::utils::TreeNode

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

The TreeNode signature is entirely 1:1 with LeetCode with additional optional features like serde.

Fields

val: i32

This uses normal i32 values that can be serialized and deserialized using serde if wanted.

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

An optional smart pointer contained within a reference cell. This provides very useful functionality like internal mutability. The poiter can be represented as the left child node of a binary tree.

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

An optional smart pointer contained within a reference cell. This provides very useful functionality like internal mutability. The poiter can be represented as the right child node of a binary tree.

Implementations

impl TreeNode

pub fn new(val: i32) -> Self

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

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

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

This method 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