Here is a step-by-step guide to solve this problem in Python: 1. First, we need to create a Node class for the Binary Tree. This class will have a value and two pointers for the left and right child. ```python class Node: def __init__(self, data): self.data = data self.left = None self.right = None ``` 2. Next, we need to create a function that will convert the linked list into a binary tree. This function will take the linked list and the index of the current node as input. ```python def convertListToBinaryTree(lst, start): # Base case for recursion if start 0: print(queue[0].data, end=" ") node = queue.pop(0) if node.left is not None: queue.append(node.left) if node.right is not None: queue.append(node.right) ``` 4. Finally, we can use these functions to solve the problem. ```python # Linked list representation of the complete binary tree lst = [1, 2, 3, 4, 5, 6, 7] # Convert the linked list into a binary tree root = convertListToBinaryTree(lst, 0) # Print the level order traversal of the binary tree printLevelOrder(root) ``` This will print the level order traversal of the binary tree.

Question

Here is a step-by-step guide to solve this problem in Python:

1. First, we need to create a Node class for the Binary Tree. This class will have a value and two pointers for the left and right child.

```python
class Node:
    def __init__(self, data):
        self.data = data
        self.left = None
        self.right = None
```

2. Next, we need to create a function that will convert the linked list into a binary tree. This function will take the linked list and the index of the current node as input.

```python
def convertListToBinaryTree(lst, start):
    # Base case for recursion
    if start < len(lst):
        node = Node(lst[start])
        node.left = convertListToBinaryTree(lst, 2 * start + 1)
        node.right = convertListToBinaryTree(lst, 2 * start + 2)
        return node
    return None
```

3. Now, we need a function to print the level order traversal of the binary tree. We can use a queue for this purpose.

```python
def printLevelOrder(root):
    if root is None:
        return
    queue = []
    queue.append(root)
    while len(queue) > 0:
        print(queue[0].data, end=" ")
        node = queue.pop(0)
        if node.left is not None:
            queue.append(node.left)
        if node.right is not None:
            queue.append(node.right)
```

4. Finally, we can use these functions to solve the problem.

```python
# Linked list representation of the complete binary tree
lst = [1, 2, 3, 4, 5, 6, 7]

# Convert the linked list into a binary tree
root = convertListToBinaryTree(lst, 0)

# Print the level order traversal of the binary tree
printLevelOrder(root)
```

This will print the level order traversal of the binary tree.

Knowee AI · Accepted Answer