rekursiv Fittwurzel des Baumes
public TreeNode FindTarget(TreeNode root, int val)
{
if (root == null || root.val == val) return root;
if (root.val < val)
return FindTarget(root.right, val);
else
return FindTarget(root.left, val);
}
PrashantUnity