0
我想删除整个二叉搜索树(树中的每个节点),你认为哪个功能会更好?删除二叉搜索树
private:
struct Node {
string value;
Node* left;
Node* right;
};
Node* root;
public:
BST() {
root = NULL;
}
~BST() {
delete root->left;
delete root->right;
}
或:
...
void destroyTree (Node*& tree) {
while (tree != NULL) {
tree = tree->left;
delete tree;
}
while (tree != NULL) {
tree = tree->right;
delete tree;
}
delete tree;
}
请添加标记** 'C' **最大化的观众人数。 –
@ J.Piquard如果你可以识别你自己的语言,你可以自己加上标签 – Bergi
@Bergi,实际上标签**'C++'**是带有部分'class BST'声明的正确标签。 –