Struct TreeNode

pub struct TreeNode<T> {
    pub value: T,
}

A tree node that holds a value of type T generic

This structure represents a single node in a binary tree. It holds a value of type T and can be compared to other TreeNodes based on the value it contains.

Fields

value: T

The value of this TreeNode

Implementations

impl<T> TreeNode<T>

pub fn new(value: T) -> Self

Creates a new TreeNode with the given value

Parameters

• value: The value to be stored in this TreeNode

Returns

• A new instance of TreeNode containing the provided value

Trait Implementations

impl<T: Clone> Clone for TreeNode<T>

fn clone(&self) -> TreeNode<T>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T: Debug> Debug for TreeNode<T>

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

Formats the value using the given formatter.

impl<T: Hash> Hash for TreeNode<T>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<T: Ord> Ord for TreeNode<T>

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

Compares two TreeNodes for total ordering.

Parameters

• other: Another TreeNode instance to compare the value to this TreeNode’s value

Returns

• An Ordering object that indicates whether the value of this TreeNode is less than, equal to, or greater than the value of the other TreeNode

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

where Self: Sized,

Compares and returns the maximum of two values.

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

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<T: PartialEq> PartialEq for TreeNode<T>

fn eq(&self, other: &TreeNode<T>) -> 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<T: Ord> PartialOrd for TreeNode<T>

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

Compares two TreeNodes for partial ordering.

Parameters

• other: Another TreeNode object to compare this TreeNodes value

Returns

• An optional Ordering object that indicates whether there exists an Ordering where this TreeNode is less than, equal to, or greater than the other TreeNode.

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

Tests less than (for self and other) and is used by the < operator.

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

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

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

Tests greater than (for self and other) and is used by the > operator.

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

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

impl<T: Eq> Eq for TreeNode<T>

impl<T> StructuralPartialEq for TreeNode<T>