Struct TreeRoot

pub struct TreeRoot {
    pub root: Option<Rc<RefCell<TreeNode>>>,
}

Wrapper class to make handling empty trees easier and building of trees easier via From impls

Fields

root: Option<Rc<RefCell<TreeNode>>>

The root of the tree held

Trait Implementations

impl Debug for TreeRoot

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

Formats the value using the given formatter.

impl From<&TreeRoot> for Vec<Option<i32>>

fn from(value: &TreeRoot) -> Self

Converts to this type from the input type.

impl From<&str> for TreeRoot

fn from(value: &str) -> Self

Expects the “[]” around the values, separated by comma “,” and only integers and “null” (which is the format you’ll get on leetcode)

Panics

This function panics if it doesn’t match the expected format

impl From<Option<Rc<RefCell<TreeNode>>>> for TreeRoot

fn from(root: Option<Rc<RefCell<TreeNode>>>) -> Self

Converts to this type from the input type.

impl From<TreeRoot> for Option<Rc<RefCell<TreeNode>>>

fn from(value: TreeRoot) -> Self

Converts to this type from the input type.

impl From<Vec<Option<i32>>> for TreeRoot

fn from(list: Vec<Option<i32>>) -> Self

Converts the incoming vec into a tree

impl From<Vec<i32>> for TreeRoot

fn from(value: Vec<i32>) -> Self

Converts to this type from the input type.

impl PartialEq for TreeRoot

fn eq(&self, other: &TreeRoot) -> 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 TreeRoot

impl StructuralPartialEq for TreeRoot