Struct binary_tree::test::TestNode

pub struct TestNode<T> {
    pub val: T,
    pub left: Option<Box<TestNode<T>>>,
    pub right: Option<Box<TestNode<T>>>,
}

A minimal Node implementation.

When should you use TestNode?

You should not use TestNode for anything, except may be to get to know what a binary tree is!

Fields

val: T

left: Option<Box<TestNode<T>>>

right: Option<Box<TestNode<T>>>

Methods

impl<T> TestNode<T>

fn new(val: T) -> TestNode<T>

Trait Implementations

impl<T: Debug> Debug for TestNode<T>

fn fmt(&self, __arg_0: &mut Formatter) -> Result

Formats the value using the given formatter.

impl<T> Node for TestNode<T>

type Value = T

fn left(&self) -> Option<&Self>

Get a reference to the left subtree

fn right(&self) -> Option<&Self>

Get a reference to the right subtree

fn value(&self) -> &T

Returns the value of the current node.

fn walk<'a, F>(&'a self, step_in: F) where F: FnMut(&'a Self) -> WalkAction

Walk down the tree

impl<T> NodeMut for TestNode<T>

type NodePtr = Box<TestNode<T>>

fn detach_left(&mut self) -> Option<Self::NodePtr>

Try to detach the left sub-tree

fn detach_right(&mut self) -> Option<Self::NodePtr>

Try to detach the right sub-tree

fn insert_left(&mut self, st: Option<Self::NodePtr>) -> Option<Self::NodePtr>

Replace the left subtree with tree and return the old one.

fn insert_right(&mut self, st: Option<Self::NodePtr>) -> Option<Self::NodePtr>

Replace the right subtree with tree and return the old one.

fn value_owned(self) -> T

Consume a Node and return its value

fn rotate_left(&mut self) -> Result<(), ()>

Try to rotate the tree left if right subtree exists

fn rotate_right(&mut self) -> Result<(), ()>

Try to rotate the tree right if left subtree exists

fn walk_mut<FI, FS, FO>(&mut self, step_in: FI, stop: FS, step_out: FO) where FI: FnMut(&mut Self) -> WalkAction, FS: FnOnce(&mut Self), FO: FnMut(&mut Self, WalkAction)

Walks down the tree by detaching subtrees, then up reattaching them back. step_in should guide the path taken, stop will be called on the node where either step_in returned Stop or it was not possible to proceed. Then step_out will be called for each node, except the final one, along the way.

fn insert_before<F>(&mut self, new_node: Self::NodePtr, step_out: F) where F: FnMut(&mut Self, WalkAction)

Insert new_node in-order before self. step_out will be invoked for all nodes in path from (excluding) the point of insertion, to (including) self, unless self is the point of insertion.

fn extract<FF, FE, FX>(&mut self, finder: FF, extractor: FE, exiter: FX) -> Option<Self::NodePtr> where FF: FnMut(&mut Self) -> WalkAction, FE: FnOnce(&mut Self, &mut Option<Self::NodePtr>), FX: FnMut(&mut Self, WalkAction)

Extract a node found by finder. This can be used in conjuction with try_remove to remove any node except the root. See CountTree::remove for an example implementation.

fn try_remove<F>(&mut self, step_out: F) -> Option<Self::NodePtr> where F: FnMut(&mut Self, WalkAction)

Replace this node with one of its descendant, returns None if it has no children.