HERE http://www.geeksforgeeks.org/print-right-view-binary-tree-2/是不使用队列的二叉树右视图的C++实现。当我尝试将其转换为 Java 时,它不起作用。这是我的Java代码:
(我认为很可能是因为我没有正确理解算法和 maxLevel 指针/引用的处理)
public static void rightView(TreeNode tNode){
int maxLevel = 0;
rViewUtil(tNode, 1,maxLevel);
}
public static void rViewUtil(TreeNode tNode, int level, int maxLevel){
if(tNode==null)
return;
if(maxLevel < level){
System.out.print(tNode.value + " ");
maxLevel = level;
}
rViewUtil(tNode.right, level+1, maxLevel);
rViewUtil(tNode.left, level+1, maxLevel);
}
本着@lifus答案的精神,但避免可变状态,您可以使用函数 return 来设置maxLevel
public static void rightView(TreeNode tNode){
int maxLevel = 0;
rViewUtil(tNode, 1,maxLevel);
}
public static int rViewUtil(TreeNode tNode, int level, int maxLevel){
if(tNode==null)
return;
if(maxLevel < level){
System.out.print(tNode.value + " ");
maxLevel = level;
}
maxLevel = rViewUtil(tNode.right, level+1, maxLevel);
maxLevel = rViewUtil(tNode.left, level+1, maxLevel);
return maxLevel
}
本文内容由网友自发贡献,版权归原作者所有,本站不承担相应法律责任。如您发现有涉嫌抄袭侵权的内容,请联系:hwhale#tublm.com(使用前将#替换为@)