Hey folks! I'm Subhayan Mukherjee, a CSE student from NIT Durgapur – and today I stumbled upon something super quirky while working on Binary Search Trees (BSTs). You probably learned in DSA class that: "If you have both inorder and preorder/postord...
Introduction The Treap is a fascinating hybrid data structure that combines the properties of a Binary Search Tree (BST) and a Heap. It is designed to maintain both the binary search property of BSTs and the heap property based on priorities. This du...
Introduction In the world of data structures, Binary Search Trees (BSTs) are one of the most essential and widely used structures. A BST is a tree-based data structure that allows for efficient searching, insertion, and deletion of elements. With its...
Introduction 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...
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...
class Solution { public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) { //check on the left side if(root.val > p.val && root.val > q.val) return lowestCommonAncestor(root.left, p, q); //c...
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...
Introduction In this blog, we will be looking into a data structure called Trees. A tree data structure is a hierarchical structure that is used to represent and organize data in a way that is easy to navigate and search. It is a collection of nodes ...
