1class TreeNode {
2 
3    int value;
4    TreeNode left;
5    TreeNode right;
6 
7    TreeNode(int value) {
8        this.value = value;
9    }
10}
11 
12public class BinaryTreeDFS {
13 
14    public static void inorderTraversal(TreeNode root) {
15 
16        if (root == null) {
17            return;
18        }
19 
20        inorderTraversal(root.left);
21 
22        System.out.print(root.value + " ");
23 
24        inorderTraversal(root.right);
25    }
26 
27    public static void main(String[] args) {
28 
29        TreeNode root = new TreeNode(1);
30 
31        root.left = new TreeNode(2);
32        root.right = new TreeNode(3);
33 
34        root.left.left = new TreeNode(4);
35        root.left.right = new TreeNode(5);
36 
37        root.right.left = new TreeNode(6);
38        root.right.right = new TreeNode(7);
39 
40        System.out.println("Inorder DFS Traversal:");
41 
42        inorderTraversal(root);
43    }
44}