Searching

Searching is a fundamental operation when working with binary trees. It involves finding a specific key value within the binary tree. There are various searching techniques that can be used, depending on the requirements and characteristics of the binary tree.

One commonly used searching technique is the inorder traversal. In inorder traversal, the left subtree is traversed first, followed by the root node, and then the right subtree. This results in visiting the nodes in ascending order of key values.

Here is an example of performing an inorder traversal of a binary tree in Java:

1  class TreeNode {
2    int val;
3    TreeNode left;
4    TreeNode right;
5    
6    TreeNode(int val) {
7        this.val = val;
8    }
9}
10
11class BinarySearchTree {
12    TreeNode root;
13
14    void inorderTraversal(TreeNode node) {
15        if (node == null) {
16            return;
17        }
18        
19        inorderTraversal(node.left);
20        System.out.print(node.val + " ");
21        inorderTraversal(node.right);
22    }
23}