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
Inorder-Traversal
8 notes
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 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 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 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.