chap indexing /* - tree node implementation *class ttnode,eprivate lval/the left record private key lkey/the node' left key private rval/the right record private key rkey/the node' right key private ttnode left/pointer to left child private ttnode center/pointer to middle child private ttnode right/pointer to right child public ttnode(center left right nullpublic ttnode(key lke lvkey rke rvttnode ttnode ttnode lkey lkrkey rklval lvrval rvleft center right public boolean isleaf(return left =nullpublic ttnode lchild(return leftpublic ttnode rchild(return rightpublic ttnode cchild(return centerpublic key lkey(return lkey/left key public lval(return lval/left value public key rkey(return rkey/right key public rval(return rval/right value public void setleft(key ke elkey klval epublic void setright(key ke erkey krval epublic void setleftchild(ttnode itleft itpublic void setcenterchild(ttnode itcenter itpublic void setrightchild(ttnode itright itfigure the - tree node implementation taken at the next levelwe take the second branch to the leaf node containing if the search key were then upon encountering the leaf containing we would find that the search key is not in the tree below is an implementation for the - tree search method