Skip to content

[feat] add Binary Tree traversal algorithm DFS (Depth First Search) #7450

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Draft
inamcodes wants to merge 2 commits into
base: master
Choose a base branch
from
+53 −0
Draft

[feat] add Binary Tree traversal algorithm DFS (Depth First Search) #7450

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
c2e1d41
add Binary Tree traversal DFS Algorithm
inamcodes Jun 8, 2026
f4fb745
Merge branch 'TheAlgorithms:master' into master
inamcodes Jun 8, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
53 changes: 53 additions & 0 deletions src/main/java/com/thealgorithms/tree/Binary Tree/DFS.Java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,53 @@
package com.thealgorithms.tree.BinaryTree;

public class DFS {

// Inorder
void inorder(Node node) {
if (node == null) return;
inorder(node.left);
System.out.print(node.val + " ");
inorder(node.right);
}

// Preorder
void preorder(Node node) {
if (node == null) return;
System.out.print(node.val + " ");
preorder(node.left);
preorder(node.right);
}

// Postorder
void postorder(Node node) {
if (node == null) return;
postorder(node.left);
postorder(node.right);
System.out.print(node.val + " ");
}

public static void main(String[] args) {
BinaryTreeDFS tree = new BinaryTreeDFS();

Node root = new Node(4);
root.left = new Node(2);
root.right = new Node(6);
root.left.left = new Node(1);
root.left.right = new Node(3);
root.right.left = new Node(5);
root.right.right= new Node(7);

System.out.print("Inorder: "); tree.inorder(root); // 1 2 3 4 5 6 7
System.out.print("\nPreorder: "); tree.preorder(root); // 4 2 1 3 6 5 7
System.out.print("\nPostorder: "); tree.postorder(root); // 1 3 2 5 7 6 4
}
}

class Node {
int val;
Node left, right;

Node(int val) {
this.val = val;
}
}
Loading