e2hang/Data-Structure
1
1
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

altered

Browse Source
This commit is contained in:
E2hang
2025-08-10 18:18:31 +08:00
parent 023973b5a1
commit 409258a8a0
1 changed files with 1 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
BinaryTree/priorityQueue/maxHBLT/maxHblt.h
View File

@@ -100,8 +100,7 @@ void maxHblt<T>::display() {
//重要 -> 合并两个子树，把y合并进入x
//* &x，指针的引用，表示指针可以修改（传入函数）
template<class T>
void maxHblt<T>::meld(binaryTreeNode<std::pair<int, T>>*& x,
binaryTreeNode<std::pair<int, T>>*& y) {
void maxHblt<T>::meld(binaryTreeNode<std::pair<int, T>>*& x, binaryTreeNode<std::pair<int, T>>*& y) {
if (y == nullptr) return;
if (x == nullptr) {
x = y;