data_forest 0.1.3

Implementation of various types of trees.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26

/// 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.
#[derive(Debug)]
pub struct BinaryNode<T: PartialOrd> {
    /// The value stored in this node.
    pub value: T,

    /// Left child node (less than parent value).
    pub left: Option<Box<BinaryNode<T>>>,

    /// Right child node (greater than parent value).
    pub right: Option<Box<BinaryNode<T>>>,
}

impl<T: PartialOrd> BinaryNode<T> {
    /// Creates a new `BinaryNode` with the given `value` and no children.
    pub fn new(value: T) -> Self {
        BinaryNode {
            value,
            left: None,
            right: None,
        }
    }
}