Differences

This shows you the differences between two versions of the page.

--- java:threads:concurrent-binary-tree [2024/01/17 03:57] – odefta
+++ java:threads:concurrent-binary-tree [2024/01/17 03:58] (current) – odefta
@@ 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:
-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 =====
-The expected output will be the in-order traversal of the binary tree after all threads have completed their insertions. In-order traversal of a binary tree prints the node values in ascending order.
-For the given input, the output should be: 2 3 4 5 6 7 8
-Certainly! Let's consider an example input and the expected output for the ConcurrentBinaryTree implementation.
-Example Input:
-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 2 inserts 3
-Thread 3 inserts 7
-Thread 4 inserts 2
-Thread 5 inserts 4
-Thread 6 inserts 6
-Thread 7 inserts 8
-These threads run concurrently and insert their respective values into the binary tree.
-Expected Output:
 The expected output will be the in-order traversal of the binary tree after all threads have completed their insertions. In-order traversal of a binary tree prints the node values in ascending order.