incidentallywe can also define binary tree in recursive way such that binary tree is either empty or consists ofa node rcalled the root of and storing an element binary treecalled the left subtree of binary treecalled the right subtree of we discuss some of the specialized topics for binary trees below the binary tree adt as an abstract data typea binary tree is specialization of tree that supports three additional accessor methodsleft( )return the left child of van error condition occurs if has no left child right( )return the right child of van error condition occurs if has no right child hasleft( )test whether has left child