I would like to confirm below understanding,
A binary tree is a tree data structure in which each node has at most two children, which are referred to as the left child and the right child.
In binary trees, a new node before insert has to specify 1) whose child it is going to be 2) mention whether new node goes as left/right child. For example(below image),
To add a new node to leaf node, a new node should also mention whether new node goes as left/right child.
For deletion, only certain nodes in a binary tree can be removed unambiguously.
Suppose that the node to delete is node A. If A has no children, deletion is accomplished by setting the child of A's parent to null. If A has one child, set the parent of A's child to A's parent and set the child of A's parent to A's child.
In a binary tree, a node with two children cannot be deleted unambiguously.
Is this understanding correct ?