BinaryTreeNode

A binary tree node must have at most two children, usually referred to as "left" and "right".

left child ≤ parent node ≤ right child

Constructor

Source:

Returns the data stored at the tree node

Source:

Holds metadata about the node, like duplicity, colour (for visualisations), or any other custom data points needed.

Source:

Returns an object literal representation of the node.

Source: