1function insert(root, val) {
2 if (!root) return new Node(val);
3 if (val < root.val) root.left = insert(root.left, val);
4 else root.right = insert(root.right, val);
5 return root;
6}
7function search(root, target) {
8 if (!root || root.val === target) return root;
9 if (target < root.val) return search(root.left, target);
10 return search(root.right, target);
11}