Struct dsalgo::splay_tree_node_recurse::Node

pub struct Node<T> {
    pub v: T,
    /* private fields */
}

have subtree size

Fields

v: T

Implementations

impl<T> Node<T>

pub fn new(v: T) -> Box<Node<T>>

pub fn splay(root: Box<Node<T>>, k: usize) -> Box<Node<T>>

pub fn merge(
l: Option<Box<Node<T>>>,
r: Option<Box<Node<T>>>
) -> Option<Box<Node<T>>>

pub fn split(
root: Option<Box<Node<T>>>,
i: usize
) -> (Option<Box<Node<T>>>, Option<Box<Node<T>>>)

pub fn insert(
root: Option<Box<Node<T>>>,
i: usize,
node: Option<Box<Node<T>>>
) -> Option<Box<Node<T>>>

pub fn pop(root: Box<Node<T>>, i: usize) -> (Box<Node<T>>, Option<Box<Node<T>>>)

pub fn binary_search<F>(f: F, root: Option<&'_ Box<Node<T>>>) -> usizewhere
F: Fn(&T) -> bool,