public static int getDiameter(BinaryTreeNode root) { if (root == null) return 0; int rootDiameter = getHeight(root.getLeft()) + getHeight(root.getRight()) + 1; int leftDiameter = getDiameter(root.getLeft()); int rightDiameter = getDiameter(root.getRight()); return Math.max(root...
代码: 1vector<TreeNode *> generateTrees(intn) {2if(n <1)3returnvector<TreeNode *>(1, NULL);45vector<vector<vector<TreeNode *> > > trees(n +1, vector<vector<TreeNode *> >(n +1, vector<TreeNode *>()));67for(intlen =1; len <= n; len++) {8for(inti =1, j = i + ...