Struct AvlTree 

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

An AVL self-balancing binary search tree.

All operations (insert, contains) run in O(log n) worst-case time. The height is always ≤ 1.44 * log2(n + 2).

Implementations

impl<T: Ord> AvlTree<T>

pub fn new() -> Self

Create a new empty AVL tree.

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

Insert a value into the tree.

Duplicate values are ignored. Time complexity: O(log n).

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

Return true if value is in the tree.

Time complexity: O(log n).

pub fn height(&self) -> usize

Return the height of the tree (0 for an empty tree).

pub fn len(&self) -> usize

Return the number of elements in the tree.

pub fn is_empty(&self) -> bool

Return true if the tree contains no elements.

Trait Implementations

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

fn default() -> Self

Returns the “default value” for a type.