---
title: "#binarysearchtree articles | Hashnode"
description: "Explore 9 articles tagged #binarysearchtree on Hashnode. Tutorials, guides, and how-tos from the community."
url: "https://hashnode.com/tag/binarysearchtree"
---

Tag

# #binarysearchtree

9 posts · 0 followers

[CHAO DU](https://hashnode.com/@chaos789) · [Sep 15, 2025](https://hashnode.com/posts/leetcode-530-minimum-absolute-difference-in-bst-java-solution-explained/68c779c4258a4a07889ae117)

### [LeetCode 530 — Minimum Absolute Difference in BST (Java Solution Explained)](https://leetlog-by-chao.hashnode.dev/leetcode-530-minimum-absolute-difference-in-bst-java-solution-explained?utm_source=hashnode&utm_medium=feed)

Understand the Minimum Absolute Difference in BST problem and explore its Java solution using recursive inorder traversal for efficient computation

2 min read · [leetlog-by-chao.hashnode.dev](https://leetlog-by-chao.hashnode.dev/leetcode-530-minimum-absolute-difference-in-bst-java-solution-explained?utm_source=hashnode&utm_medium=feed)

[Subhayan Mukherjee](https://hashnode.com/@Shubh-exe) · [Apr 7, 2025](https://hashnode.com/posts/a-weird-glitch-in-bst-tree-building/67f3d3b28de6b037f4fb0bc1)

### [🎉 A Weird Glitch in BST Tree Building!](https://bst-uniqueness-paradox.hashnode.dev/a-weird-glitch-in-bst-tree-building?utm_source=hashnode&utm_medium=feed)

Discover how two different Binary Search Trees can share the same inorder and postorder traversals. A surprising exception in DSA fundamentals explained sim

2 min read · [bst-uniqueness-paradox.hashnode.dev](https://bst-uniqueness-paradox.hashnode.dev/a-weird-glitch-in-bst-tree-building?utm_source=hashnode&utm_medium=feed)

[Arka Infotech](https://hashnode.com/@arkainfotech) · [Jan 11, 2025](https://hashnode.com/posts/treap-data-structure-combining-bsts-and-heaps/678241c869a098a8b146cd3f)

### [Treap Data Structure: Combining BSTs and Heaps](https://blogs.arkainfotech.in/treap-data-structure-combining-bsts-and-heaps?utm_source=hashnode&utm_medium=feed)

Explore the Treap data structure, a hybrid of Binary Search Trees and Heaps, featuring properties, operations, and Python implementation

6 min read · [blogs.arkainfotech.in](https://blogs.arkainfotech.in/treap-data-structure-combining-bsts-and-heaps?utm_source=hashnode&utm_medium=feed)

[Arka Infotech](https://hashnode.com/@arkainfotech) · [Jan 10, 2025](https://hashnode.com/posts/binary-search-trees-explained-algorithm-and-use-cases/678106b9a0e08d7d94494811)

### [Binary Search Trees Explained: Algorithm and Use Cases](https://blogs.arkainfotech.in/binary-search-trees-explained-algorithm-and-use-cases?utm_source=hashnode&utm_medium=feed)

Learn how Binary Search Trees work with algorithm insights, use cases, and Python code examples for efficient data management

7 min read · [blogs.arkainfotech.in](https://blogs.arkainfotech.in/binary-search-trees-explained-algorithm-and-use-cases?utm_source=hashnode&utm_medium=feed)

[Aman Pratap Singh](https://hashnode.com/@amanps12) · [Dec 1, 2024](https://hashnode.com/posts/know-about-binary-search-tree/674c0474d7c6dbb9cdac8362)

### [Know About Binary Search Tree](https://amanps12.hashnode.dev/know-about-binary-search-tree?utm_source=hashnode&utm_medium=feed)

Binary Search Trees (BSTs) are a specialized form of binary trees designed to optimize the searching process.

19 min read · [amanps12.hashnode.dev](https://amanps12.hashnode.dev/know-about-binary-search-tree?utm_source=hashnode&utm_medium=feed)

[Karelle Hofler](https://hashnode.com/@itskarelleh) · [Oct 18, 2023](https://hashnode.com/posts/explanation-for-leetcode-230-kth-smallest-element-in-bst-solution-code-in-java-and-javascript/652f425309242132a192eeb2)

### [Explanation for Leetcode 230: Kth Smallest Element in BST - Solution Code in Java and JavaScript](https://karellehofler.hashnode.dev/explanation-for-leetcode-230-kth-smallest-element-in-bst-solution-code-in-java-and-javascript?utm_source=hashnode&utm_medium=feed)

This intermediate Leetcode problem may seem challenging but it's not once you understand the traversal and the basics of binary search trees. To solve this problem you would have to do an in-order traversal. If you're not familiar with traversing a b...

2 min read · [karellehofler.hashnode.dev](https://karellehofler.hashnode.dev/explanation-for-leetcode-230-kth-smallest-element-in-bst-solution-code-in-java-and-javascript?utm_source=hashnode&utm_medium=feed)

[Miradil Zeynalli](https://hashnode.com/@mmzeynalli) · [Oct 13, 2023](https://hashnode.com/posts/solving-dsa-eolymp-4036-4038/65c36ff8751d3f159c267870)

### [Solving DSA Problems. Eolymp 4036 & 4038: Pre-Order/Post-Order Traversal of a Tree](https://mmzeynalli.hashnode.dev/solving-dsa-eolymp-4036-4038?utm_source=hashnode&utm_medium=feed)

Problem statement These are two identical problems: Eolymp 4036 and 4038. The following problem statement is that of 4038, but explanation covers both problems. Given an array of integers. Create a Binary Search Tree from these numbers. If the inse...

4 min read · [mmzeynalli.hashnode.dev](https://mmzeynalli.hashnode.dev/solving-dsa-eolymp-4036-4038?utm_source=hashnode&utm_medium=feed)

[Abdul Ahad Sheikh](https://hashnode.com/@Ahad) · [Jul 8, 2023](https://hashnode.com/posts/pgdac-data-structures-and-algorithms-binary-search-tree-part-1/64a95020e9914fe95887ad2a)

### [PGDAC | Data Structures and Algorithms | Binary Search Tree Part-1](https://pgdacmate.hashnode.dev/pgdac-data-structures-and-algorithms-binary-search-tree-part-1?utm_source=hashnode&utm_medium=feed)

\- Module taught by Vishal Jagtap

10 min read · [pgdacmate.hashnode.dev](https://pgdacmate.hashnode.dev/pgdac-data-structures-and-algorithms-binary-search-tree-part-1?utm_source=hashnode&utm_medium=feed)
