Struct Node 

pub struct Node<K> {
    pub left: SplayNode<K>,
    pub right: SplayNode<K>,
    pub key: K,
}

Fields

left: SplayNode<K>

right: SplayNode<K>

key: K

Implementations

impl<K: Ord + Clone + Debug> Node<K>

pub fn new(k: K) -> Rc<RefCell<Self>>

pub fn insert_left_most(&mut self, inserted: SplayNode<K>)

pub fn insert_right_most(&mut self, inserted: SplayNode<K>)

pub fn left_most_key(&self) -> K

pub fn right_most_key(&self) -> K

pub fn bstinsert(&mut self, inserted: &mut Rc<RefCell<Node<K>>>)

Trait Implementations

impl<K: Clone> Clone for Node<K>

fn clone(&self) -> Node<K>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K: Debug> Debug for Node<K>

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

Formats the value using the given formatter.

impl<K: Ord> PartialEq for Node<K>

fn eq(&self, other: &Self) -> bool

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.