search的四种实现:
public class TreeSearch {
//search的四种实现方式
BinaryTree.TreeNode search1(BinaryTree.TreeNode root, int val) {
if (root == null) {
return null;
}
if (root.val == val) {
return root;
}
BinaryTree.TreeNode left = search1(root.left, val);
if (left != null) {
return left;
}
return