Struct BinaryTree 

pub struct BinaryTree<T> {
    pub root: TreeNode<T>,
    pub left: Option<Box<BinaryTree<T>>>,
    pub right: Option<Box<BinaryTree<T>>>,
}

A BinaryTree data structure that contains a TreeNode and two optional child nodes (left and right)

This structure represents a binary tree where each node contains a TreeNode value and two child nodes, left and right, which are either Some(Box<BinaryTree<T>>), or None if the node has no children.

Fields

root: TreeNode<T>

The root of the BinaryTree

left: Option<Box<BinaryTree<T>>>

The left child of the BinaryTree, or None if there is no left child

right: Option<Box<BinaryTree<T>>>

The right child of the BinaryTree, or None if there is no right child

Implementations

impl<T> BinaryTree<T>

pub fn new( root: TreeNode<T>, left: Option<Box<BinaryTree<T>>>, right: Option<Box<BinaryTree<T>>>, ) -> Self

Creates a new BinaryTree with the given node, left child, and right child.

Parameters

• root: A TreeNode object that represents the topmost node of this BinaryTree
• left: An optional BinaryTree Box pointer that points to the left child of this BinaryTree, or None if no left child exists
• right: An optional BinaryTree Box pointer that points to the right child of this BinaryTree, or None if no right child exists

Returns

• A new instance of a BinaryTree containing the given root node, left child, and right child

Examples

use dsa::data_structures::tree::{BinaryTree, TreeNode};
let tree = BinaryTree::new(
    TreeNode::new(1), 
    Some(Box::new(BinaryTree::new(TreeNode::new(2), None, None))),
    Some(Box::new(BinaryTree::new(TreeNode::new(3), None, None)))
);