Write a recursive function to calculate the height of a binary tree in Java.

Write a recursive function to calculate the height of a binary tree in Java.

题目类型: 技术面试题

这是一道技术面试题，常见于澳洲IT公司面试中。

难度: medium

标签: interviewbit, data-structure, topic-specific, data-structures, algorithms

参考答案摘要

Consider that every node of a tree represents a class called Node as given below: public class Node{ int data; Node left; Node right; } Then the height of the binary tree can be found as follows: int ...

本题提供 STAR 原则详细解答和技术解析，登录匠人学院学习中心即可查看完整答案。