Free JavaScript Computer Science Course

Exercises

Did you finish Parts I, II, and III of our binary search tree implementation exercises? If you're looking for more practice, complete the following CodeWars problems:

https://www.codewars.com/kata/sum-the-tree/train/javascript

https://www.codewars.com/kata/fun-with-trees-array-to-tree

https://www.codewars.com/kata/fun-with-trees-is-perfect

https://leetcode.com/problems/unique-binary-search-trees/

https://leetcode.com/problems/binary-search-tree-iterator/

https://leetcode.com/problems/validate-binary-search-tree/

1 Complexity Analysis and Recursion 5 sections, 2 - 3 hours

2 Search and Sorting Algorithms 3 sections, 2 - 3 hours

3 Linked Lists 5 sections, 1 - 2 hours

4 Stacks and Queues 4 sections, 2 - 3 hours

5 Binary Search Trees and Heaps 6 sections, 2 - 3 hours

6 Hash Tables 3 sections, 2 - 3 hours

7 Graphs 4 sections, 2 - 3 hours

{ Binary Search Trees Exercises. }

Exercises

1 Complexity Analysis and Recursion 5 sections, 2 - 3 hours

2 Search and Sorting Algorithms 3 sections, 2 - 3 hours

3 Linked Lists 5 sections, 1 - 2 hours

4 Stacks and Queues 4 sections, 2 - 3 hours

5 Binary Search Trees and Heaps 6 sections, 2 - 3 hours

6 Hash Tables 3 sections, 2 - 3 hours

7 Graphs 4 sections, 2 - 3 hours

{ Binary Search Trees Exercises. }

Exercises

Signed up already? Please enter your email to confirm.

Get 200+ hours of free content, tutorials, and screencasts

Share your email, and we'll give you a confirmation code to unlock all of our materials. No spam, we promise.

Tell us more about yourself

Please answer these two questions to help us build the perfect Inf-Paces experience for you.