Given an ordered array (increment), the write program constructs a two-fork tree with a minimum height.

Given an ordered array (increment), the write program constructs a two-fork tree with a minimum height.

    struct Node {int value;          Node *left;      Node *right;            };  void Createtree (int a[], int begin, int end, node* &root, Node *parent, bool leftchild) {if (Begin >          End) {return;          } int mid = begin + (End-begin)/2;          Node *p = new node ();          P->value = A[mid];          if (root = NULL) {root = P;              } else {if (leftchild) {parent->left = P;              } else {parent->right = p;          }} if (Begin > Mid-1) {p->left = NULL;          } else {Createtree (A, Begin, mid-1, Root, p, true);          } if (Mid+1 > End) {p->right = NULL; } else {Createtree (A, mid+1, end, Root, p, false);   }      }

Given an ordered array (increment), the write program constructs a two-fork tree with a minimum height.