Binary Tree Node Structure in DSA C++ - Build from Scratch

Binary Tree Node Structure

📖 Scenario: Imagine you are building a simple family tree app. Each person can have up to two children. To store this information, you need a basic structure to represent each person and their children.

🎯 Goal: Create a basic binary tree node structure in C++ to represent each person in the family tree with their name and pointers to their left and right children.

📋 What You'll Learn

Define a struct called Node

Include a string variable called name to store the person's name

Include two Node* pointers called left and right for the children

Initialize left and right to nullptr in the constructor

💡 Why This Matters

🌍 Real World

Binary trees are used in many applications like family trees, decision trees, and organizing data for quick search.

💼 Career

Understanding how to create and use binary tree nodes is fundamental for software development roles involving data structures and algorithms.

1

Create the Node struct with a name variable

Define a struct called Node with a public string variable named name.

DSA C++

// Define struct Node with a string variable name
// Your code here

Hint

Use struct Node { string name; }; to define the structure.

2

Add left and right child pointers

Inside the Node struct, add two public pointers named left and right of type Node*.

DSA C++

#include 
using namespace std;

struct Node {
    string name;
    // Add Node* pointers left and right here
    // Your code here
};

Hint

Declare Node* left; and Node* right; inside the struct.

3

Add a constructor to initialize name and children

Add a constructor to Node that takes a string parameter name and initializes the name variable. Also, initialize left and right to nullptr.

DSA C++

#include 
using namespace std;

struct Node {
    string name;
    Node* left;
    Node* right;

    // Add constructor here
    // Your code here
};

Hint

Use an initializer list in the constructor to set name, left, and right.

4

Create a Node instance and print its name

Create a Node object named root with the name "Grandparent". Then print root.name using std::cout.

DSA C++

#include 
#include 
using namespace std;

struct Node {
    string name;
    Node* left;
    Node* right;

    Node(string name) : name(name), left(nullptr), right(nullptr) {}
};

// Create Node root with name "Grandparent" and print root.name
// Your code here

Hint

Use Node root("Grandparent"); and cout << root.name << endl;.