From a74566c71e62a76503a7f55cfe1fc3e0cd3e534b Mon Sep 17 00:00:00 2001 From: SHIVEN YADAV S <155547804+shivenyadavs@users.noreply.github.com> Date: Sun, 3 Nov 2024 21:46:00 +0530 Subject: [PATCH] Update Depth_first_traversal.md --- docs/Depth_first_traversal.md | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) diff --git a/docs/Depth_first_traversal.md b/docs/Depth_first_traversal.md index fced27e34..e422fa42a 100644 --- a/docs/Depth_first_traversal.md +++ b/docs/Depth_first_traversal.md @@ -1,6 +1,6 @@ --- id: dft -title: Depth-First Traversal (DFT) +title: "Depth-First Traversal (DFT)" sidebar_label: Depth-First Traversal description: "In this blog post, we'll explore Depth-First Traversal (DFT), a tree traversal algorithm that explores nodes by going as deep as possible before backtracking." tags: [dsa, algorithms, tree, traversal] @@ -98,3 +98,4 @@ int main() { return 0; } +```