How can I use binary trees in C++?

How can I use binary trees in C++?

Binary trees can be used in C++ for various applications like expression parsing, searching, and sorting data.

Can you give me an example of a binary tree implementation?

Sure! Here's a simple implementation of a binary tree in C++:

class Node {
public:
    int data;
    Node* left;
    Node* right;
    Node(int val) : data(val), left(nullptr), right(nullptr) {}
};

class BinaryTree {
public:
    Node* root;
    BinaryTree() : root(nullptr) {}
    void insert(int val);
    // Other methods like traversal can be added here
};

This defines a basic structure for a binary tree.

What are some common operations I can perform on a binary tree?

Common operations include insertion, deletion, traversal (in-order, pre-order, post-order), and searching for a value.

How do I traverse a binary tree in C++?

You can traverse a binary tree using recursion. For example, an in-order traversal can be implemented like this:

void inOrder(Node* node) {
    if (node == nullptr) return;
    inOrder(node->left);
    std::cout << node->data << " ";
    inOrder(node->right);
}