题目:
在二叉树中寻找值最大的节点并返回
给出如下一棵二叉树:
1
/ \
-5 2
/ \ / \
0 3 -4 -5
返回值为 3
的节点。
代码:
/**
* Definition of TreeNode:
* public class TreeNode {
* public int val;
* public TreeNode left, right;
* public TreeNode(int val) {
* this.val = val;
* this.left = this.right = null;
* }
* }
*/
public class Solution {
/*
* @param root: the root of tree
* @return: the max node
*/
public TreeNode maxNode(TreeNode root) {
// write your code here
int max;
TreeNode T=new TreeNode(0);
T=root;
if(root!=null)
{
max=root.val;
TreeNode R=new TreeNode(0);
R=root;
if(R.left!=null)
{
TreeNode Left=new TreeNode(0);
Left=maxNode(R.left);
if(Left.val>max)
{
max=Left.val;
T=Left;
}
}
if(R.right!=null)
{
TreeNode Right=new TreeNode(0);
Right=maxNode(R.right);
if(Right.val>max)
{
max=Right.val;
T=Right;
}
}
}
return T;
}
}