---
title: "Discussion on \"Apply your recursion concepts to traverse BST\" | Hashnode"
description: "Discussion on \"Apply your recursion concepts to traverse BST\". Preorder Traversing\nPreorder Traversing is a traversing technique in which we iterate the root element followed by the left element and the right element."
url: "https://hashnode.com/posts/apply-your-recursion-concepts-to-traverse-bst/6264ee93d82f4558aff8a70d"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [Apply your recursion concepts to traverse BST](https://abhishekvaish.hashnode.dev/apply-your-recursion-concepts-to-traverse-bst?utm_source=hashnode&utm_medium=feed)

Preorder Traversing Preorder Traversing is a traversing technique in which we iterate the root element followed by the left element and the right element.

Apr 24, 2022 · 3 min read · abhishekvaish.hashnode.dev  
Updated Apr 27, 2022  
Read the article

-   [#java](https://hashnode.com/tag/java)
-   [#data-structures](https://hashnode.com/tag/data-structures)
-   [#coding](https://hashnode.com/tag/coding)
-   [#competitive-programming](https://hashnode.com/tag/competitive-programming)

## Written by

[Abhishek Vaish](https://hashnode.com/@abhishekvaish)

@abhishekvaish · Uttar Pradesh, India

  
[View profile](https://hashnode.com/@abhishekvaish)

Software Engineer | Data Engineer

Software Engineer | Data Engineer

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
