For a binary tree with at least one node, if there are n nodes with degree 0 and m nodes with degree 2, then n = ________ ( This problem is judged by string matching, Please make sure your answer don't contain any blanks. ) 在一棵非空二中,若度为 0 的结点的个数 n ,度为 2 的结点个数为 m ,则有 n=________ ( 系统根据字符串匹配来判定答案,所以您的答案中请不要包含空格 )