Binary Search Tree in Python with Tests

Binary Search Tree holds 31 problems (10 Easy, 20 Medium, 1 Hard). Generate any of them into the current directory with lcpy gen -n <number>.

#	Problem	Difficulty	Solution
95	Unique Binary Search Trees II	Medium	solution.py
96	Unique Binary Search Trees	Medium	solution.py
98	Validate Binary Search Tree	Medium	solution.py
99	Recover Binary Search Tree	Medium	solution.py
108	Convert Sorted Array to Binary Search Tree	Easy	solution.py
109	Convert Sorted List to Binary Search Tree	Medium	solution.py
173	Binary Search Tree Iterator	Medium	solution.py
230	Kth Smallest Element in a BST	Medium	solution.py
235	Lowest Common Ancestor of a Binary Search Tree	Medium	solution.py
255	Verify Preorder Sequence in Binary Search Tree	Medium	solution.py
270	Closest Binary Search Tree Value	Easy	solution.py
272	Closest Binary Search Tree Value II	Hard	solution.py
285	Inorder Successor in BST	Medium	solution.py
333	Largest BST Subtree	Medium	solution.py
426	Convert Binary Search Tree to Sorted Doubly Linked List	Medium	solution.py
449	Serialize and Deserialize BST	Medium	solution.py
450	Delete Node in a BST	Medium	solution.py
501	Find Mode in Binary Search Tree	Easy	solution.py
510	Inorder Successor in BST II	Medium	solution.py
530	Minimum Absolute Difference in BST	Easy	solution.py
538	Convert BST to Greater Tree	Medium	solution.py
653	Two Sum IV - Input is a BST	Easy	solution.py
669	Trim a Binary Search Tree	Medium	solution.py
700	Search in a Binary Search Tree	Easy	solution.py
701	Insert into a Binary Search Tree	Medium	solution.py
703	Kth Largest Element in a Stream	Easy	solution.py
776	Split BST	Medium	solution.py
783	Minimum Distance Between BST Nodes	Easy	solution.py
897	Increasing Order Search Tree	Easy	solution.py
938	Range Sum of BST	Easy	solution.py
1214	Two Sum BSTs	Medium	solution.py

Welcome

Getting Started

Practice

CLI

Catalog

Contributing

Troubleshooting

Binary Search Tree in Python with Tests