Hire a node.js Developer

Part 1: Do some outside research on some of the internals specific to JavaScript. a)Describe what a prototype is in the context of JavaScript objects. How do they emulate inheritance? Provide a practical example. b) Investigate the new class syntax (tip: it was introduced in ECMAScript 6). What are the differences between classes and regular functions? c) Recreate the LinkedList function on [login to view URL] (will be provided) to use the class syntax. What changes were needed to make it work? d) Using the class from part c, implement a queue and stack with appropriate enqueue/dequeue and push/pop functionality. Make any adjustments necessary to the LinkedList class to make this happen. Generate some non-trivial mock data and appropriate printing to demonstrate functionality. Part 2: Implement a binary search tree in JavaScript. A node in the tree should have at least the following data: { key: “some string”, value: { an arbitrary value } // Any other properties to make a BST } Again, generate some non-trivial data and appropriate printing to demonstrate functionality. At a minimum it must support insertion, searching (provide examples), and in/pre/post-order traversal. For all three traversals, print out the sequence in which the nodes were traversed to demonstrate correctness. Part 3: Write out the algorithm for selection sort. a) Do a T(n) analysis on the worst case run time of the sort, (Hint: similar to insertion sort) b) For some g(n), prove that T(n) ∈