pleft | A web-based appointment scheduling tool | Backend As A Service library

I've watched many videos but couldn't implement the code into my code. All I need is a smooth jump. I've written most of this from video tutorials by DaFluffyPotato. I've just begun OOP so it wud be great if there aren't too many classes and such!

Please read the comments in the code

For some reason, in the JQuery the .animate doesn't work when using a variable into it, so the size and the position doesn't change into the second animate. The rest of the values like "60px" work, but that doesn't. I think it can be because it is not a number, but I don't know how to fix it. Ignore the //, they are only failed tests.

This is for a class assignment, but I can't figure out how to fix my problem. I wrote the following:

Question: I have many "divs" in first and second row, I can create a Rectangle with "pageY" and "pageX" and position, but I'd like to create a Line.
Does anyone know how can I do that?

Details : when the user clicks on two points for the first time, a line is created and one class is added to the points for better visibility.
The second time the user clicks, classes are removed and, then, if no class are appended for two point, a new line is created again.
If the user clicks on a line, the line will be removed.
When I talk about "lines" I mean "rectangles" that I would like to replace with lines.
Here is my view

Below is my JS code :

I'm using Rmarkdown to produce beautiful documents (like with LaTex), but there is a problem I can't solve.

I'm printing graph in the following way:

Below is the code I use to 1) extract numbers from a text file and save them into an array; 2) use the array as “input” and import the numbers from the array into a binary tree; 3) search through the binary tree to find user-input values, if found, output “Value Found”, if not found, output “Value not found.”

The code works perfectly fine. But I am struggling on the last part. I have to make the program output how many compares it took to find (or not find) each value in the binary tree.

I am new to programming; this is my very first question on Stake-overflow.

I want to save the position of the dropped div in local storage and retrieve this position when I refresh the page.

Here is what I have achieved so far using Javascript:

1) I can store the position of dropped div in local storage (by calling a function on enddrop event.)

2) I can retrieve the stored position (by calling a function on onload event)

What I want:

1) I want to position the dropped div according to retrieved position (position left and top from local storage.)

Here is my code:

HTML

So this is my first question. I've searched the site, found something and applied the suggestions given in them but I'm still unsure if I've done it the right way.

I'm working on a template library and here's my implementation of BST class template:

I have a multithreaded quicksort algorithm witch runs correct but then never stops executing.

I tried adding return statemants everywhere but nothing helps.

How do I stop all thread from running when they are done? Is there a way for a thread terminate its self when done?