BST Insert

Category: Trees & BSTs

Difficulty: intermediate

Description: Insert node in binary search tree

Time Complexity: O(log n)

Space Complexity: O(h)

Related LeetCode Problems

• 701. Insert into a Binary Search Tree (Medium)
• 98. Validate Binary Search Tree (Medium)
• 450. Delete Node in a BST (Medium)
• 230. Kth Smallest Element in a BST (Medium)
• 108. Convert Sorted Array to Binary Search Tree (Easy)
• 109. Convert Sorted List to Binary Search Tree (Medium)
• 272. Closest Binary Search Tree Value II (Hard)
• 653. Two Sum IV - Input is a BST (Easy)
• 333. Largest BST Subtree (Medium)
• 99. Recover Binary Search Tree (Hard)