and deletion in tree costly thereforeinstead of using an array representationwe can use linked representationin which every node is represented as structure with three fieldsone for holding dataone for linking it with the left subtreeand the third for linking it with right subtree as shown herenotes leftchild data rightchild we can create such structure using the following declarationstruct tnode int data struct tnode *lchild,*rchild} tree representation that uses this node structure is shown in figure figure linked representation of binary tree null null null null null implementation of binary tree like general treebinary trees are implemented through linked lists typical node in binary tree has structure as follows (refer to figure )struct node struct node *leftchildint nodevalue/this can be of any data type *struct node *rightchild}figure node structure of binary tree left child value right child the 'left child'and 'right childare pointers to another tree-node the "leaf node(not shownhere will have null values for these pointers the binary tree creation follows very simple principle for the new element to be addedcompare it with the current element in the tree if its value is less than the current element in the treethen move towards the left side of that element or else to its right if there is no sub tree on lovely professional university