Binary tree

A binary tree is an implementation of the tree data structuredata structure in which each node has at most two children. A binary tree is made up of a finite set of elements called nodes. The genesis node of any given tree is referred to as the "root" of the tree. The root node of a binary tree can either be empty or contain a left and right subtree, which must also be binary trees themselves. Any descendant node of a root node is typically referred to as the root's "child". If a root node has two "child" nodes, then we would refer to those nodes instead as it's "children". We refer to the root of these child nodes as the "parent" node. The connection itself that creates a relationship between a parent node and a child node is called an "edge".

A binary tree is an implementation of the tree data structure in which each node has at most two children. A binary tree is made up of a finite set of elements called nodes. The genesis node of any given tree is referred to as the "root" of the tree. The root node of a binary tree can either be empty or contain a left and right subtree, which must also be binary trees themselves. Any descendant node of a root node is typically referred to as the root's "child". If a root node has two "child" nodes, then we would refer to those nodes instead as it's "children". We refer to the root of these child nodes as the "parent" node. The connection itself that creates a relationship between a parent node and a child node is called an "edge".