Interface representing a binary tree data type.
A binary tree is a hierarchical data structure in which each node has at most two children, referred to as the left child and the right child. The topmost node is called the root, and nodes without children are called leaves.
The type of elements in the binary tree.
The type of nodes in the binary tree, extending IBinaryTreeNode.
Readonly
Interface representing a binary tree data type.
A binary tree is a hierarchical data structure in which each node has at most two children, referred to as the left child and the right child. The topmost node is called the root, and nodes without children are called leaves.