首页 > 代码库 > Codility Tree Height
Codility Tree Height
public class HeightOfTreeSolution { static int height=-1; public int solution(Tree T) { // write your code in Java SE 8 if (T == null) return height; height = heightOfTree(T); return height; } public int heightOfTree(Tree node){ if (node!=null) { if (node.l==null) { return 1+heightOfTree(node.r); } if (node.r==null) { return 1+heightOfTree(node.l); } else{ return 1+Math.max(heightOfTree(node.r),heightOfTree(node.l)); } } return 0; } }
问题描述:
Write a function:
class Solution { public int solution(Tree T); }
that, given a non-empty binary tree T consisting of N nodes, returns its height. For example, given tree T shown in the figure above, the function should return 2, as explained above. Note that the values contained in the nodes are not relevant in this task.
Codility Tree Height
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。