java:threads:concurrent-binary-tree
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| java:threads:concurrent-binary-tree [2024/01/17 01:57] – odefta | java:threads:concurrent-binary-tree [2025/01/02 18:22] (current) – external edit 127.0.0.1 | ||
|---|---|---|---|
| Line 115: | Line 115: | ||
| Suppose we have seven threads, each inserting a unique value into the binary tree. The values to be inserted by these threads are as follows: | Suppose we have seven threads, each inserting a unique value into the binary tree. The values to be inserted by these threads are as follows: | ||
| - | Thread 1 inserts 5 | + | Thread 1 inserts 5 \\ |
| - | Thread 2 inserts 3 | + | Thread 2 inserts 3 \\ |
| - | Thread 3 inserts 7 | + | Thread 3 inserts 7 \\ |
| - | Thread 4 inserts 2 | + | Thread 4 inserts 2 \\ |
| - | Thread 5 inserts 4 | + | Thread 5 inserts 4 \\ |
| - | Thread 6 inserts 6 | + | Thread 6 inserts 6 \\ |
| - | Thread 7 inserts 8 | + | Thread 7 inserts 8 \\ |
| ===== Expected Output ===== | ===== Expected Output ===== | ||
java/threads/concurrent-binary-tree.1705456672.txt.gz · Last modified: (external edit)