binary search tree Problems

Data Structures

7 problems

#	Title	Acceptance	Difficulty
1	Problem Challenge 2: Structurally Unique Binary Search Trees (hard) binary search tree binary tree recursion +2 more	30.1%	hard
2	Problem Challenge 3: Count of Structurally Unique Binary Search Trees (hard) binary search tree dynamic programming recursion +2 more	34.4%	hard
3	Same Tree (medium) binary tree binary search tree recursion +2 more	47.1%	Med.
4	Binary Search Tree Iterator (medium) binary search tree recursion breadth-first search +2 more	90.0%	Med.
5	Validate Binary Search Tree (medium) binary search tree recursion binary tree +1 more	28.3%	Med.
6	Construct Binary Tree from Preorder and Inorder Traversal (medium) binary tree binary search tree recursion +4 more	52.7%	Med.
7	Lowest Common Ancestor of a Binary Search Tree (medium) binary search tree binary tree recursion +1 more	37.5%	Med.