Jul 27, 2025 · 2 min read · Problem Given the root of a binary tree, determine if it is a valid binary search tree (BST). A valid BST is defined as follows: The left subtree of a node contains only nodes with keys less than the node's key. The right subtree of a node contains...
Join discussionJul 27, 2025 · 3 min read · Problem Implement the BSTIterator class that represents an iterator over the in-order traversal of a binary search tree (BST): (link) BSTIterator(TreeNode root) Initializes an object of the BSTIterator class. The root of the BST is given as part of ...
Join discussionJul 26, 2025 · 2 min read · Problem Statement Given a root node reference of a BST and a key, delete the node with the given key in the BST. Return the root node reference (possibly updated) of the BST. Basically, the deletion can be divided into two stages: Search for a node ...
Join discussionJul 11, 2025 · 3 min read · LeetCode 653. Two Sum IV - Input is a BST Approach The problem requires us to find if there exist any two nodes in a Binary Search Tree (BST) that sum up to a given target value k. The solution uses an inorder traversal approach combined with a has...
Join discussion
May 17, 2025 · 5 min read · Introduction Binary Search Trees (BSTs) are a fundamental data structure in computer science that combine the hierarchical structure of binary trees with the power of ordering to enable efficient searching, insertion, and deletion. If you're preparin...
Join discussion
Feb 21, 2025 · 1 min read · 1. Basics Search an element Ceil of an element Floor of an element Insert an element Delete an element 2. Medium Find K-th smallest/largest element in BST Check if a tree is a BST or BT LCA in Binary Search Tree Construct a BST from a pre...
Join discussionJan 10, 2025 · 7 min read · 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...
Join discussion
Sep 25, 2024 · 45 min read · In 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...
Join discussionAug 17, 2024 · 5 min read · In this blog, you will get a deep knowledge about binary search tree, which includes creating binary search based on Linked list and various operations, like creation, inserting, deleting and searching on binary tree data structure. What is Binary Se...
Join discussion
Jun 24, 2023 · 7 min read · Introduction 🧑🏽💻 Welcome to the fascinating world of binary trees! If you're new to this topic or looking to reinforce your understanding, you're in the right place. In this tutorial, I'll take you on a step-by-step journey through the fundamenta...
Join discussion