algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-11-02 04:31:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

fix binary_search_tree code

Browse Source
This commit is contained in:
krahets
2023-08-31 02:31:31 +08:00
parent f7ab4797bf
commit 628d8a516b
14 changed files with 195 additions and 227 deletions
Download Patch File Download Diff File Expand all files Collapse all files

35
codes/cpp/chapter_tree/binary_search_tree.cpp
View File

@ -12,11 +12,13 @@ class BinarySearchTree {
TreeNode *root;
public:
BinarySearchTree(vector<int> nums) {
sort(nums.begin(), nums.end()); // 排序数组
root = buildTree(nums, 0, nums.size() - 1); // 构建二叉搜索树
/* 构造方法 */
BinarySearchTree() {
// 初始化空树
root = nullptr;
}
/* 析构方法 */
~BinarySearchTree() {
freeMemoryTree(root);
}
@ -26,19 +28,6 @@ class BinarySearchTree {
return root;
}
/* 构建二叉搜索树 */
TreeNode *buildTree(vector<int> nums, int i, int j) {
if (i > j)
return nullptr;
// 将数组中间节点作为根节点
int mid = (i + j) / 2;
TreeNode *root = new TreeNode(nums[mid]);
// 递归建立左子树和右子树
root->left = buildTree(nums, i, mid - 1);
root->right = buildTree(nums, mid + 1, j);
return root;
}
/* 查找节点 */
TreeNode *search(int num) {
TreeNode *cur = root;
@ -60,9 +49,11 @@ class BinarySearchTree {
/* 插入节点 */
void insert(int num) {
// 若树为空，直接提前返回
if (root == nullptr)
// 若树为空，则初始化根节点
if (root == nullptr) {
root = new TreeNode(num);
return;
}
TreeNode *cur = root, *pre = nullptr;
// 循环查找，越过叶节点后跳出
while (cur != nullptr) {
@ -143,8 +134,12 @@ class BinarySearchTree {
/* Driver Code */
int main() {
/* 初始化二叉搜索树 */
vector<int> nums = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15};
BinarySearchTree *bst = new BinarySearchTree(nums);
BinarySearchTree *bst = new BinarySearchTree();
// 请注意，不同的插入顺序会生成不同的二叉树，该序列可以生成一个完美二叉树
vector<int> nums = {8, 4, 12, 2, 6, 10, 14, 1, 3, 5, 7, 9, 11, 13, 15};
for (int num : nums) {
bst->insert(num);
}
cout << endl << "初始化的二叉树为\n" << endl;
printTree(bst->getRoot());