Struct AVLTree 

pub struct AVLTree<T: Ord> { /* private fields */ }

A set based on an AVL Tree.

An AVL Tree is a self-balancing binary search tree. It tracks the height of each node and performs internal rotations to maintain a height difference of at most 1 between each sibling pair.

Implementations

impl<T: Ord> AVLTree<T>

pub fn new() -> AVLTree<T>

Creates an empty AVLTree.

pub fn contains(&self, value: &T) -> bool

Returns true if the tree contains a value.

pub fn insert(&mut self, value: T) -> bool

Adds a value to the tree.

Returns true if the tree did not yet contain the value.

pub fn remove(&mut self, value: &T) -> bool

Removes a value from the tree.

Returns true if the tree contained the value.

pub fn len(&self) -> usize

Returns the number of values in the tree.

pub fn is_empty(&self) -> bool

Returns true if the tree contains no values.

pub fn iter(&self) -> Iter<'_, T>

Returns an iterator that visits the values in the tree in ascending order.

Trait Implementations

impl<T: Ord> Default for AVLTree<T>

fn default() -> Self

Returns the “default value” for a type.

impl<T: Ord> FromIterator<T> for AVLTree<T>

fn from_iter<I: IntoIterator<Item = T>>(iter: I) -> Self

Creates a value from an iterator.