binartree 2.0.2

Binary Tree realisation
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16

use crate::node::Node;

/// *English*: Tree's branch
/// Contains key, right and left node.
///
/// *Russian*: Ветвь дерева.
/// Хранит ключ, правый и левый узел.

#[derive(Debug, Clone, PartialOrd, PartialEq)]
pub(crate) struct Branch<T>
	where T: Copy + Clone + Ord + Eq
{
	pub(crate) key: T,
	pub(crate) right: Node<T>,
	pub(crate) left: Node<T>,
}