LeetCode 2773: Height of Special Binary Tree Solution

Master LeetCode problem 2773 (Height of Special Binary Tree), a medium challenge, with our optimized solutions in Java, C++, and Python. Explore detailed explanations, test your code in our interactive editor, and prepare for coding interviews.

2773. Height of Special Binary Tree

Medium

Tree Depth-First Search Breadth-First Search Binary Tree

Problem Explanation

Explanation

To find the height of a special binary tree, we need to traverse through the tree and calculate the height based on the given rules. The rules are:

The height of a leaf node is 0.
If a node has only one child, its height is twice the height of its child.
If a node has two children, its height is the maximum height of its children plus 1.

We can use a recursive approach to calculate the height of the tree. We start by checking if the current node is a leaf node, if so, return 0. Otherwise, we recursively calculate the heights of the left and right children based on the rules mentioned above.

Solution Code

class TreeNode {
    int val;
    TreeNode left;
    TreeNode right;

    TreeNode(int val) {
        this.val = val;
    }
}

class Solution {
    public int height(TreeNode root) {
        if (root == null) {
            return -1;
        }

        if (root.left == null && root.right == null) {
            return 0;
        }

        if (root.left == null) {
            return 2 * height(root.right);
        }

        if (root.right == null) {
            return 2 * height(root.left);
        }

        return Math.max(height(root.left), height(root.right)) + 1;
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 2773 (Height of Special Binary Tree)?

This page provides optimized solutions for LeetCode problem 2773 (Height of Special Binary Tree) in Java, C++, and Python, along with a detailed explanation and an interactive code editor to test your code.

What is the time complexity of LeetCode 2773 (Height of Special Binary Tree)?

The time complexity for LeetCode 2773 (Height of Special Binary Tree) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 2773 on DevExCode?

Yes, DevExCode provides an interactive code editor where you can write, test, and run your code for LeetCode 2773 in Java, C++, or Python.

Back to LeetCode Solutions