Kanchan Raikanchanraiii.hashnode.dev·Dec 8, 2024Day 20: 100 Days of DSAWelcome to Day 20 of my 100 Days of DSA challenge! Today, I solved five problems focused on basics of binary trees. Here's a quick look at the questions I tackled and how I approached them 🤖✨ Check out my GitHub repository for all my solutions and p...100 Days of DSAbinary search tree
Aman Pratap Singhamanps12.hashnode.dev·Dec 1, 2024Know About Binary Search TreeIntroduction Binary Search Trees (BSTs) are a specialized form of binary trees designed to optimize the searching process. While a standard binary tree offers no inherent structure to facilitate faster lookups, BSTs introduce a pivotal property: for...10 likesBinaryTrees
Jyotiprakash Mishrablog.jyotiprakash.org·Sep 25, 2024Introduction to TreesIn computer science, trees are a fundamental non-linear data structure composed of nodes connected by edges. A tree is a hierarchical model that represents a collection of elements, each of which can have a number of children but only one parent (exc...2.7K readsTrees
Akshaya Biswalakshaya-biswal.hashnode.dev·Aug 19, 2024Binary Search TreeIntroduction A Binary Search Tree (BST) is a data structure that maintains sorted data in a way that allows for efficient insertion, deletion, and lookup operations. Each node in a BST has the following properties: Node: Contains a value (data). Le...Data Structures and Algorithms in JavaScriptDSA
Khrystyna Klapushchakkhrystyna.hashnode.dev·Nov 29, 2023Binary Search Trees: Implementation and Practical ApplicationsBinary search trees (BSTs) are a fundamental data structure commonly used in computer science, offering several advantages over traditional and linked lists. Unlike linear structures, BSTs provide logarithmic time complexity for critical operations, ...26 readsBinary Search Algorithm
Kallol Bairagikallolbairagi.hashnode.dev·Oct 24, 2023#98.Validate Binary Search Tree [LeetCode Grind 75 in Java]class Solution { public boolean isValid(TreeNode root, long minLimit, long maxLimit){ if(root == null) return true; if(root.val <= minLimit || root.val >= maxLimit) return false; return (isValid(root.left, minLimit, root....LeetCode Grind 75 in JavaDSA
Mohammed Rumanmohammedruman.hashnode.dev·Aug 27, 2023Demystifying Deletion of Nodes from a Binary Search Tree (BST)Introduction : Binary Search Trees (BSTs) are foundational data structures in the realm of computer science, celebrated for their efficient search, insertion, and deletion operations. Their elegant design leverages a hierarchical arrangement of nodes...DSA
Jose Ramireznowaymyname.hashnode.dev·Aug 23, 2023Recursion in Binary Search Trees: Java EditionWelcome back to my blog, dear readers! Today, I'm stepping into the realm of Java and diving into Binary Search Trees (BSTs). Whether you're a seasoned Java developer or someone just getting started, I hope you'll find this exploration both informati...Java
Jose Ramireznowaymyname.hashnode.dev·Aug 22, 2023Demystifying Recursion in Binary Search TreesBinary Search Trees (or BSTs) have always fascinated me, not only because of their inherent nature to keep things sorted but also due to the variety of algorithms they offer. From insertion to deletion, BSTs are robust. Today, I'd like to delve into ...47 readsBinary Search Algorithm
Mehzabin Aothoimehzabin.hashnode.dev·Aug 13, 2023Binary Tree Vs Binary Search TreeWe know that a tree is a non-linear data structure that represents hierarchical data and contains no cycles. Now, let's delve into a commonly asked question during interviews: When do we call a tree a binary tree, and how does it differ from a binary...31 readsbinary tree
