Write a divide-and-conquer algorithm in pseudo code to count the number of internal nodes in a binary tree.The tree node definition is as follows

class Node {

Node * lchild;

Node * rchild;

int val;

};