The analogy for a binary search tree is to maintain parent pointers in each binary node in addition to the pointers to the node’s children. That is, every node except the root will have a pointer to...

The analogy for a binary search tree is to maintain parent pointers in each binary node in addition to the pointers to the node’s children. That is, every node except the root will have a pointer to its parent in the tree. This type of binary tree is called a doubly linked binary tree . Write insertion and removal operations for this tree.