C++可執行文件崩潰

Question

我開始創建一個二叉樹。到目前爲止，我所添加的是一個插入函數，我相信它工作正常。當我一起編譯我的應用程序，頭文件和實現文件時，它會生成一個可執行文件，但在其上面有一個關於所使用的異常處理程序的錯誤代碼。當我運行可執行文件時，它會崩潰。我不明白它爲什麼會崩潰，請有人幫忙！提前致謝。

命令行錯誤http://gyazo.com/7ca1e8fb1a66da39e927e9ba627d3f53

我叫應用程序文件mainprogramming.cpp稱爲Header.h

class BinaryTree 
{ 
// Can only be accessed by the class itself 
private: 
    struct node 
    { 
     // Data stored in this node of he tree 
     int data; 
     // The left branch of the tree 
     node *left; 
     // The right branch of the tree 
     node *right; 
    }; 

    node *tree; 
    void insert(node *tree, int value); 

// Can be accessed by all 
public: 
    BinaryTree(){}; 
    ~BinaryTree(); 
    void insert(int value); 

}; 

我實現文件名爲implementation.cpp

#include <iostream> 
#include <cstdlib> 

#include "Header.h" 

using namespace std; 

int main() 
{ 
    int Rndnums[10] = {3, 99, 76, 49, 32, 9, 77, 64, 81, 24}; 

    BinaryTree *tree = new BinaryTree(); 

    for(int i = 0; i < 10; i++) 
    { 
     tree->insert(Rndnums[i]); 
    } 

    return 0; 
} 

我的頭文件

#include <iostream> 
#include <cstdlib> 

#include "Header.h" 

using namespace std; 

// Inserts a value into the tree - notice ** 
void BinaryTree::insert(node *tree, int value) 
{ 
    // Check if nullptr. If so set new node 
    if (tree == nullptr) 
    { 
     // Create new node 
     tree = new node; 
     // Set new value 
     tree->data = value; 
     // Set branches to nullptr 
     tree->left = nullptr; 
     tree->right = nullptr; 
    } 
    // If the input value is less than the node in the tree 
    else if(value < tree->data) 
    { 
     insert(tree->left, value); 
     cout << "The value " << value << "has been added as a left child\n"; 
    } 
    // If the input value is greater than the node in the tree 
    else if(value > tree->data) 
    { 
     insert(tree->right, value); 
     cout << "The value " << value << "has been added as a right child\n"; 
    } 
    else 
    { 
     cout << "The value " << value << "can only be equal and must already exist in the tree\n"; 
    } 
} 

void BinaryTree::insert(int value) 
{ 
    insert(this->tree, value); 
    cout << "It ran"; 
} 

Answer 1

你的問題是在你插入電話：

void BinaryTree::insert(node * leaf_head, int value) 
{ 
    ... 
} 

要複製的指針地址，然後試圖創建該存儲空間的物體，然後修改對象。

void BinaryTree::insert(node * & leaf_head, int value) 
{ 
    ... 
} 

這樣，你實際上是改變，而不是它的副本內BinaryTree的tree指針：當你將其更改爲以該指針引用它工作正常。