LeetCode 897: Increasing Order Search Tree
A clear explanation of rearranging a binary search tree into an increasing right-only tree using inorder traversal.
Tag
Binary-Search-Tree
31 notes
LeetCode 938: Range Sum of BST
A clear explanation of solving Range Sum of BST using DFS with binary search tree pruning.
LeetCode 783: Minimum Distance Between BST Nodes
A clear explanation of finding the minimum difference between any two nodes in a BST using inorder traversal.
LeetCode 776: Split BST
A clear explanation of splitting a binary search tree into two BSTs using recursion and pointer rewiring.
LeetCode 701: Insert into a Binary Search Tree
A clear explanation of inserting a value into a binary search tree using recursive and iterative traversal.
LeetCode 669: Trim a Binary Search Tree
A clear explanation of trimming a BST so that all remaining node values lie inside a given inclusive range.
LeetCode 653: Two Sum IV - Input is a BST
A clear explanation of finding whether two different nodes in a binary search tree sum to a target value.
LeetCode 235: Lowest Common Ancestor of a Binary Search Tree
A clear explanation of finding the lowest common ancestor in a binary search tree using BST ordering properties.
LeetCode 230: Kth Smallest Element in a BST
A clear explanation of finding the kth smallest value in a binary search tree using inorder traversal.
LeetCode 700: Search in a Binary Search Tree
Search for a target value in a binary search tree and return the subtree rooted at the matching node.
LeetCode 538: Convert BST to Greater Tree
A clear explanation of converting a BST into a greater tree using reverse inorder traversal and a running sum.
LeetCode 530: Minimum Absolute Difference in BST
A clear explanation of finding the minimum difference between two BST node values using inorder traversal.
LeetCode 510: Inorder Successor in BST II
A clear explanation of finding the inorder successor in a binary search tree when nodes contain parent pointers.
LeetCode 501: Find Mode in Binary Search Tree
A clear explanation of finding the most frequent value or values in a binary search tree using inorder traversal.
LeetCode 450: Delete Node in a BST
Delete a node from a binary search tree while preserving the BST property using recursive search and inorder successor replacement.
LeetCode 449: Serialize and Deserialize BST
Serialize a binary search tree compactly with preorder traversal and rebuild it using BST value bounds.
LeetCode 426: Convert Binary Search Tree to Sorted Doubly Linked List
Convert a BST into a sorted circular doubly linked list in-place using inorder traversal.
LeetCode 333: Largest BST Subtree
A clear explanation of Largest BST Subtree using postorder traversal and subtree state propagation.
LeetCode 285: Inorder Successor in BST
A binary-search-style solution for finding the smallest node greater than p in a binary search tree.
LeetCode 272: Closest Binary Search Tree Value II
A clear explanation of the Closest Binary Search Tree Value II problem using inorder traversal and a fixed-size sliding window.
LeetCode 270: Closest Binary Search Tree Value
A clear explanation of the Closest Binary Search Tree Value problem using the BST property to walk toward the target.
LeetCode 255: Verify Preorder Sequence in Binary Search Tree
A clear explanation of the Verify Preorder Sequence in Binary Search Tree problem using a monotonic stack and lower bound tracking.
LeetCode 99: Recover Binary Search Tree
A detailed guide to solving Recover Binary Search Tree with inorder traversal and two misplaced nodes.
LeetCode 98: Validate Binary Search Tree
A detailed guide to solving Validate Binary Search Tree with recursive lower and upper bounds.
LeetCode 96: Unique Binary Search Trees
A detailed guide to solving Unique Binary Search Trees with dynamic programming and the Catalan recurrence.
LeetCode 95: Unique Binary Search Trees II
A detailed guide to solving Unique Binary Search Trees II with recursive tree generation over value ranges.
LeetCode 173: Binary Search Tree Iterator
A clear explanation of designing an iterator over a BST using controlled inorder traversal with a stack.
LeetCode 109: Convert Sorted List to Binary Search Tree
A clear explanation of converting a sorted linked list into a height-balanced binary search tree using slow and fast pointers.
LeetCode 108: Convert Sorted Array to Binary Search Tree
A clear explanation of building a height-balanced binary search tree from a sorted array using divide and conquer.
Binary Tree Online Sort
Maintain a sorted sequence by inserting elements into a binary search tree as they arrive and extracting them in order.
Tree Sort
Insert all elements into a binary search tree, then traverse the tree in sorted order.