{"id":664,"date":"2024-10-10T13:40:10","date_gmt":"2024-10-10T08:10:10","guid":{"rendered":"https:\/\/codexplained.in\/?p=664"},"modified":"2025-11-24T15:57:57","modified_gmt":"2025-11-24T10:27:57","slug":"find-height-of-binary-tree","status":"publish","type":"post","link":"https:\/\/codexplained.in\/?p=664","title":{"rendered":"Find Height of Binary Tree"},"content":{"rendered":"
\n#include <stdio.h>\n#include <stdlib.h>\n\n\/\/ Structure for a binary tree node\nstruct Node {\n    int data;\n    struct Node* left;\n    struct Node* right;\n};\n\n\/\/ Function to create a new node\nstruct Node* createNode(int data) {\n    struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));\n    newNode->data = data;\n    newNode->left = NULL;\n    newNode->right = NULL;\n    return newNode;\n}\n\n\/\/ Function to calculate the height of the binary tree\nint height(struct Node* root) {\n    if (root == NULL) {\n        return -1;\n    }\n\n    int leftHeight = height(root->left);\n    int rightHeight = height(root->right);\n\n    return (leftHeight > rightHeight ? leftHeight : rightHeight) + 1;\n}\n\nint main() {\n    \/\/ Creating the binary tree\n    struct Node* root = createNode(1);\n    root->left = createNode(2);\n    root->right = createNode(3);\n    root->left->left = createNode(4);\n    root->left->right = createNode(5);\n    root->right->left = createNode(6);\n    root->right->right = createNode(7);\n\n    \/\/ Calculating the height of the tree\n    int treeHeight = height(root);\n    printf("Height of the binary tree is: %d\\n", treeHeight);\n\n    return 0;\n}\n\n<\/pre><\/div>\n\n\n
Explanation<\/h3>\n\n\n\n
    \n
  1. Node Creation<\/strong>: The createNode<\/code> function allocates memory for a new node and initializes its data<\/code> field with the given value. The left<\/code> and right<\/code> pointers are set to NULL<\/code>.<\/li>\n\n\n\n
  2. Building the Tree<\/strong>: We manually create a binary tree with the following structure:<\/li>\n<\/ol>\n\n\n\n
            1\n      \/   \\\n     2     3\n    \/ \\   \/ \\\n   4   5 6   7\n<\/code><\/pre>\n\n\n\n
    Height Calculation<\/strong>: The height<\/code> function calculates the height of the tree recursively by determining the maximum height between the left and right subtrees and adding 1 for the root node.Output<\/strong>: The main<\/code> function calculates the height of the binary tree and prints it.<\/p>\n\n\n\n
    Output<\/h3>\n\n\n\n
    When you run the program, it will display:<\/p>\n\n\n\n
    Height of the binary tree is: 2\n<\/code><\/pre>\n\n\n\n
    Explanation of the Output<\/h3>\n\n\n\n
      \n
    • The height of the tree is 2<\/code> because:\n
        \n
      • Nodes 4<\/code>, 5<\/code>, 6<\/code>, and 7<\/code> are at level 2<\/code>.<\/li>\n\n\n\n
      • Nodes 2<\/code> and 3<\/code> are at level 1<\/code>.<\/li>\n\n\n\n
      • The root node 1<\/code> is at level 0<\/code>.<\/li>\n<\/ul>\n<\/li>\n\n\n\n
      • The longest path from the root to a leaf node is of length 2<\/code> (e.g., 1 -> 2 -> 4<\/code>).<\/li>\n<\/ul>\n