Struct TreeNode 

pub struct TreeNode<T: Ord + Copy + Debug + Display> {
    pub value: T,
    /* private fields */
}

Node struct for AVLTree

Fields

value: T

Trait Implementations

impl<T: Clone + Ord + Copy + Debug + Display> Clone for TreeNode<T>

fn clone(&self) -> TreeNode<T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Ord + Copy + Debug + Display> CommonTreeNodeTrait<T> for TreeNode<T>

fn get_left(&self) -> Option<Rc<RefCell<TreeNode<T>>>>

Get left child node

fn get_right(&self) -> Option<Rc<RefCell<TreeNode<T>>>>

Get right child node

fn get_value(&self) -> T

Get value from current node

fn get_value_to_print(&self) -> String

Get value string from current node

fn count_leaves(&self) -> u32

Return the leaves number of current node, which will be called by CommonTreeTrait.count_leaves

fn get_height(&self) -> u32

Return the height of current node, which will be called by CommonTreeTrait.height

fn in_order_traversal(&self)

Print nodes inorder, which will be called by CommonTreeTrait.in_order_traversal

fn in_order_traversal_for_test(&self, container: &mut Vec<T>)

fn pre_order_traversal(&self)

Print nodes preorder, which will be called by CommonTreeTrait.pre_order_traversal

fn pre_order_traversal_for_test(&self, container: &mut Vec<T>)

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

Determine whether the node and its successors contains given value, which will be called by CommonTreeTrait.contains

fn get_min_value_in_children(&self) -> T

fn get_max_value_in_children(&self) -> T

fn print(&self)

fn print_helper( &self, row_index: usize, column_index: usize, container: &mut [&mut [String]], height: usize, )

impl<T: Ord + Copy + Debug + Display> CommonTreeTrait<T, TreeNode<T>> for AVLTree<T>

fn get_root(&self) -> Option<Rc<RefCell<TreeNode<T>>>>

fn count_leaves(&self) -> u32

Counts leaves(None nodes) of the Tree

fn height(&self) -> u32

Gets height of the Tree (from root to leaves)

fn in_order_traversal(&self)

Prints Tree inorder

fn in_order_traversal_for_test(&self, container: &mut Vec<T>)

fn pre_order_traversal(&self)

Prints red-black tree preorder

fn pre_order_traversal_for_test(&self, container: &mut Vec<T>)

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

Determine whether the tree contains given value

fn is_tree_empty(&self) -> bool

fn min(&self) -> Option<T>

fn max(&self) -> Option<T>

fn print(&self)

impl<T: Debug + Ord + Copy + Debug + Display> Debug for TreeNode<T>

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

Formats the value using the given formatter.

impl<T: Ord + Copy + Debug + Display> Drop for TreeNode<T>

fn drop(&mut self)

Executes the destructor for this type.

fn pin_drop(self: Pin<&mut Self>)

🔬This is a nightly-only experimental API. (pin_ergonomics)

Execute the destructor for this type, but different to Drop::drop, it requires self to be pinned.

impl<T: PartialEq + Ord + Copy + Debug + Display> PartialEq for TreeNode<T>

fn eq(&self, other: &TreeNode<T>) -> bool

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

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

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

impl<T: Ord + Copy + Debug + Display> StructuralPartialEq for TreeNode<T>