Struct BinaryNode 

pub struct BinaryNode<T: PartialOrd> {
    pub value: T,
    pub left: Option<Box<BinaryNode<T>>>,
    pub right: Option<Box<BinaryNode<T>>>,
}

A node in a binary tree structure.

Each node contains a value of generic type T and optional left/right child nodes wrapped in Box for heap allocation.

Fields

value: T

The value stored in this node.

left: Option<Box<BinaryNode<T>>>

Left child node (less than parent value).

right: Option<Box<BinaryNode<T>>>

Right child node (greater than parent value).

Implementations

impl<T: PartialOrd> BinaryNode<T>

pub fn new(value: T) -> Self

Creates a new BinaryNode with the given value and no children.

Trait Implementations

impl<T: Debug + PartialOrd> Debug for BinaryNode<T>

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

Formats the value using the given formatter.