Lecture 272:- Linked Representation of Binary Tree

In the linked representation of a binary tree, each node of the tree is represented as an object (struct or class) that contains three fields:

1. Data: This field holds the value or data associated with the node.
2. Left Child: This field is a pointer or reference to the left child node of the current node.
3. Right Child: This field is a pointer or reference to the right child node of the current node.

The basic structure of a node in the linked representation is as follows (in C++):

cppCopy code

struct Node {    int data;        // Data stored in the node    Node* left;      // Pointer to the left child node    Node* right;     // Pointer to the right child node    Node(int val) {        data = val;        left = nullptr;        right = nullptr;    } };

In this representation, a binary tree can be created by linking nodes together using the left and right pointers. The root of the tree is a pointer to the topmost node.

Here's an example of creating a binary tree using the linked representation:

cppCopy code

#include <iostream> struct Node {    int data;    Node* left;    Node* right;    Node(int val) {        data = val;        left = nullptr;        right = nullptr;    } }; int main() {    // Create a simple binary tree:    //      1    //     / \    //    2   3    //   / \    //  4   5    Node* root = new Node(1);    root->left = new Node(2);    root->right = new Node(3);    root->left->left = new Node(4);    root->left->right = new Node(5);    // Accessing and printing the values of nodes    std::cout << "Root data: " << root->data << std::endl;    std::cout << "Left child data: " << root->left->data << std::endl;    std::cout << "Right child data: " << root->right->data << std::endl;    std::cout << "Left child's left child data: " << root->left->left->data << std::endl;    // Remember to free the memory after use to avoid memory leaks.    delete root->left->left;    delete root->left->right;    delete root->left;    delete root->right;    delete root;    return 0; }

In this example, we create a binary tree with five nodes using the linked representation. The Node struct has a constructor to set the initial values for the data and pointers. We access and print the data stored in different nodes using the pointers. Finally, we free the allocated memory to avoid memory leaks.