Easy 2 point
Medium 4 points
Hard 6 points
Ninja 10 points
| Question | Type | Level | Solve |
|---|---|---|---|
| Write a function to check whether the given binary tree has the given value node? | Data Structures | Medium | Solve |
| Write a function to check whether the given binary tree is a min heap? | Data Structures | Hard | Solve |
| Write a function that checks whether the given binary tree is a max heap? | Data Structures | Hard | Solve |
| Write a function that checks whether the given binary tree is a binary search tree? | Data Structures | Hard | Solve |
| Write a function that returns post order traversal list of node values? | Data Structures | Medium | Solve |
| Write a function that returns in order traversal list of node values? | Data Structures | Medium | Solve |
| Write a function that returns pre order traversal list of node values? | Data Structures | Medium | Solve |
| Write a function to find the value of middle node of the given linked list? | Data Structures | Medium | Solve |
| Write a function that sums the values of given linked list? | Data Structures | Medium | Solve |
| Write a function that removes the tail node of the given linked list? | Data Structures | Medium | Solve |
Practice JavaScript Online
Become a Javascript Ninja with Javascript Challenges
Welcome to JavaScript Ninjas, your premier destination for mastering JavaScript online. Whether you're a novice or an experienced coder, our platform offers a dynamic environment to practice JavaScript online, tackle challenging coding challenges, and elevate your skills to ninja-level proficiency. With our curated collection of real-time JavaScript challenges, you'll have the opportunity to hone your coding prowess and become a true JavaScript Ninja. Join our community today and embark on your journey to becoming a coding master!