notes new(tnode) ->data ->dataq->lchild copytree( ->lchild) ->rchild copytree( ->rchild)return( ) summary tree is set of one or more nodes such that there is specially designated node called rootand remaining nodes are partitioned into disjoint set of nodes the degree of node of tree is the number of sub-trees having this node as rootor it is number of decedents of node if degree is zero then it is called terminal node or leaf node of tree degree of tree is defined as the maximum of degree of the nodes of the tree tree non of whose nodes has more than children is known as -ary tree in other wordsan -ary tree is tree whose degree is at the most binary tree is special type of tree having degree binary tree of depth can have maximum - number of nodes if binary tree has fewer than - nodesit is not full binary tree keywords degree of treethe highest degree of node appearing in the tree inordera tree traversing method in which the tree is traversed in the order of left-treenode and then right-tree level of nodethe number of nodes that must be traversed to reach the node from the root nodea data structure that holds information and links to other nodes postordera tree traversing method in which the tree is traversed in the order of left-treerighttree and then node preordera tree traversing method in which the tree is traversed in the order of nodeleft-tree and then right-tree root nodethe node in tree which does not have parent node treea two-dimensional data structure comprising of nodes where one node is the root and rest of the nodes form two disjoint sets each of which is tree lovely professional university