Common data structure problems and solutions in C++

Common data structure problems and solutions in C

Data structure is one of the most basic and core concepts in computer science. In C programming, we often need to use various data structures to solve practical problems. However, sometimes we may encounter some problems, such as how to initialize a stack or linked list, how to search in a binary tree, etc. This article will introduce common data structure problems in C and give corresponding solutions, along with specific code examples.

Question 1: How to initialize a stack?

The stack is a first-in, last-out data structure, usually used to solve problems that require remembering history. In C, we can use the stack class provided by STL to define and use the stack.

#include <iostream>
#include <stack>

int main() {
    std::stack<int> myStack;
    myStack.push(1);
    myStack.push(2);
    myStack.push(3);

    while (!myStack.empty()) {
        std::cout << myStack.top() << std::endl;
        myStack.pop();
    }

    return 0;
}

Question 2: How to initialize a linked list?

Linked list is a common data structure that stores data through pointer connections between nodes. In C, we can implement linked lists through custom structures or classes. The following is a simple linked list example:

#include <iostream>

struct Node {
    int data;
    Node* next;
};

int main() {
    Node* head = new Node;
    Node* second = new Node;
    Node* third = new Node;

    head->data = 1;
    head->next = second;

    second->data = 2;
    second->next = third;

    third->data = 3;
    third->next = nullptr;

    // 遍历链表并打印数据
    Node* current = head;
    while (current != nullptr) {
        std::cout << current->data << std::endl;
        current = current->next;
    }

    // 释放链表内存
    delete head;
    delete second;
    delete third;

    return 0;
}

Question 3: How to search in a binary tree?

Binary tree is a common data structure that stores data by having each node have at most two child nodes. In C, we can implement binary trees through custom structures or classes. The following is a simple binary tree example:

#include <iostream>

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

TreeNode* search(TreeNode* root, int value) {
    if (root == nullptr || root->data == value) {
        return root;
    }

    if (value < root->data) {
        return search(root->left, value);
    }

    return search(root->right, value);
}

int main() {
    TreeNode* root = new TreeNode;
    root->data = 4;

    TreeNode* left = new TreeNode;
    left->data = 2;

    TreeNode* right = new TreeNode;
    right->data = 6;

    root->left = left;
    root->right = right;

    // 在二叉树中查找值为2的节点
    TreeNode* result = search(root, 2);
    if (result != nullptr) {
        std::cout << "找到了" << std::endl;
    } else {
        std::cout << "未找到" << std::endl;
    }

    // 释放二叉树内存
    delete root;
    delete left;
    delete right;

    return 0;
}

Above, we introduced common data structure problems in C and gave corresponding solutions, along with specific code examples. By understanding and mastering the solutions to these problems, we are better able to apply and manage data structures, thereby improving the efficiency and reliability of our programs. Hope it helps readers!

The above is the detailed content of Common data structure problems and solutions in C++. For more information, please follow other related articles on the PHP Chinese website!