Struct woodland::binary_tree::BinaryTreeNode

pub struct BinaryTreeNode<T> { /* fields omitted */ }

The most simple node type in woodland. Stores a data field, a NodeId, as well as a left and right child.

All get’s and set’s are implemented via the NodeOperations and BinaryNodeOperations traits.

Notice that there is no way to create a BinaryTreeNode explicitly, as all nodes must be created by the corresponding tree’s memory arena. To learn more about memory arena’s and the implementation of tree’s in woodland, refer to the documentation home page.

Trait Implementations

impl<T> BinaryNodeOperations for BinaryTreeNode<T>

fn get_left(&self) -> Option<NodeId>

Get the left node

fn get_right(&self) -> Option<NodeId>

Get the right node

fn set_left(&mut self, left_node_id: Option<NodeId>)

Set the left node to a node by it’s NodeId

fn set_right(&mut self, right_node_id: Option<NodeId>)

Set the right node to a node by it’s NodeId

impl<T: Debug> Debug for BinaryTreeNode<T>

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

Formats the value using the given formatter.

impl<T: Hash> Hash for BinaryTreeNode<T>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H) where
    H: Hasher, 

Feeds a slice of this type into the given Hasher.

impl<'a, T> IterativeTreeOperations<BinaryTreeNode<T>> for BinaryTree<T> where
    T: Hash,
    T: Eq,
    T: PartialEq, 

fn preorder_iter(&self) -> Box<dyn Iterator<Item = &BinaryTreeNode<T>>>

Get a preorder traveral iterator.

fn inorder_iter(&self) -> Box<dyn Iterator<Item = &BinaryTreeNode<T>>>

Get an inorder traversal iterator.

fn postorder_iter(&self) -> Box<dyn Iterator<Item = &BinaryTreeNode<T>>>

Get a postorder traversal iterator.

impl<T> NodeOperations for BinaryTreeNode<T>

type T = T

fn new(data: T, id: NodeId) -> Self

Create a new instance of the node with a given NodeId

fn get_id(&self) -> NodeId

Get a reference to the id of the node

fn get_data(&self) -> &T

Get a reference to the data inside the node

fn get_data_mut(&mut self) -> &mut T

Get a mutable reference to the data inside the node

impl<T: PartialEq> PartialEq<BinaryTreeNode<T>> for BinaryTreeNode<T>

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

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &BinaryTreeNode<T>) -> bool

This method tests for !=.

impl<T> TreeOperations<BinaryTreeNode<T>> for BinaryTree<T> where
    T: Hash,
    T: Eq,
    T: PartialEq, 

fn new() -> Self

Create a new instance of the tree with an empty root.

fn create_node(&mut self, data: T) -> NodeId

Genereate a new mutable reference to a NodeType. You must call this function to get new references since we are allocating all references in the Arena.

fn count(&self) -> usize

Get the number of nodes in the tree.

fn is_empty(&self) -> bool

Returns true if there are no nodes in the tree, and returns false otherwise.

fn get_node(&self, node_id: NodeId) -> Option<&BinaryTreeNode<T>>

Get a refrence to a NodeType<T> from a given NodeId, if a node with the specified NodeId exists in the tree.

fn get_node_mut(&mut self, node_id: NodeId) -> Option<&mut BinaryTreeNode<T>>

Get a mutable reference to a NodeType<T> from a given NodeId, if a node with the specified NodeId exists in the tree.

fn search(&self, node_id: NodeId) -> bool

Search to see if a node is inside the tree.

fn insert(&mut self, _node: NodeId)

Insert a node into the tree.

impl<T: Eq> Eq for BinaryTreeNode<T>

impl<T> StructuralEq for BinaryTreeNode<T>

impl<T> StructuralPartialEq for BinaryTreeNode<T>