self assessment notes in the context of the figure given below give the answers of self assessment what is the degree of node ( ( ( ( what is the degree of node ( ( ( ( what is the level of node ( ( ( ( what is the level of node ( ( ( ( fill in the blanks to delete node from binary search tree the method to be used depends on the order ldr is called the order lrd is called and the order dlr is called binary tree is special type of tree having degree degree three tree is called tree node with degree zero is called node state the following statements are true or false binary tree of depth can have maximum - number of nodes for binary treemaximum number of nodes at level is * - full binary tree is binary of depth having nodes if it has it is not full binary tree review questions give the array representation of complete binary tree with depth having the number of nodes lovely professional university