data structures using write short notes on(acomplete binary trees (bextended binary trees (ctournament trees (dexpression trees (ehuffman trees (fgeneral trees (gforests consider the tree given below nowdo the following(aname the leaf nodes (bname the non-leaf nodes (cname the ancestors of (dname the descendants of (ename the siblings of (ffind the height of the tree (gfind the height of sub-tree rooted at (hfind the level of node (ifind the in-orderpre-orderpost-orderand levelorder traversal for the expression tree given belowdo the following(aextract the infix expression it represents (bfind the corresponding prefix and postfix expressions (cevaluate the infix expressiongiven avail left - - data right - - - - - - - - - - - draw the memory representation of the binary tree given below convert the prefix expression -/ab*+bcd into infix expression and then draw the corresponding expression tree consider the trees given below and state whether they are complete binary tree or full binary tree what is the maximum number of levels that binary search tree with nodes can have what is the maximum height of tree with nodes what is the maximum number of nodes that can be found in binary tree at levels and draw all possible non-similar binary trees having three nodes draw the binary tree having the following memory representationroot