判断题 偏易
#20665

下面代码构建的树一定是完全二叉树: struct TreeNode { int value ; TreeNode * left ; TreeNode * rig…

下面代码构建的树一定是完全二叉树:

struct TreeNode {
	int value;
	TreeNode* left;
	TreeNode* right;
};

TreeNode* buildCompleteBinaryTree() {
	TreeNode* root = new TreeNode{1};
	root->left = new TreeNode{2};
	root->right = new TreeNode{3};
	root->left->left = new TreeNode{4};
	root->left->right = new TreeNode{5};
	root->right->left = new TreeNode{6};
	return root;
}
未登录也能判分,登录后才会记录
答案与解析
正确答案:对
这道题暂未补解析。