Construct Complete Binary Tree from its Linked List Representation
Last Updated :
19 Sep, 2024
Given the Linked List Representation of a Complete Binary Tree, the task is to construct the complete binary tree. The complete binary tree is represented as a linked list in a way where if the root node is stored at position i, its left, and right children are stored at position 2*i+1, and 2*i+2 respectively.
Examples:
Input: 1->2->3>4->5
Output:
Input: 10->12->15->25->30->36
Output:
[Expected Approach] Using Level Order Traversal - O(n) Time and O(n) Space:
We are mainly given level order traversal in sequential form. Head of linked list is always the root of the tree. The first node as root and that the next two nodes are left and right children of root. So we know partial Binary Tree.
The idea is to do Level order traversal of the partially built Binary Tree using queue and traverse the linked list at the same time. At every step, we take the parent node from queue, make next two nodes of linked list as children of the parent node, and push the next two nodes to queue.
Below is the implementation of the above approach:
C++
// C++ program to create a Complete Binary tree
// from its Linked List Representation
#include <iostream>
#include <queue>
using namespace std;
class Lnode {
public:
int data;
Lnode* next;
Lnode(int value) {
data = value;
next = nullptr;
}
};
class Tnode {
public:
int data;
Tnode* left;
Tnode* right;
Tnode(int value) {
data = value;
left = right = nullptr;
}
};
// Converts a given linked list representing a complete
// binary tree into the linked representation of a binary tree.
Tnode* convert(Lnode* head) {
if (head == nullptr) {
return nullptr;
}
// Queue to store the parent nodes
queue<Tnode*> q;
// The first node is always the root node,
// and add it to the queue
Tnode* root = new Tnode(head->data);
q.push(root);
// Move the pointer to the next node
head = head->next;
// Until the end of the linked list is reached,
// do the following steps
while (head) {
// Take the parent node from the queue
// and remove it from the queue
Tnode* parent = q.front();
q.pop();
// Take the next two nodes from the linked list
Tnode* leftChild = nullptr;
Tnode* rightChild = nullptr;
// Create left child
if (head) {
leftChild = new Tnode(head->data);
q.push(leftChild);
head = head->next;
}
// Create right child
if (head) {
rightChild = new Tnode(head->data);
q.push(rightChild);
head = head->next;
}
// Assign the left and right children of the parent
parent->left = leftChild;
parent->right = rightChild;
}
return root;
}
// Level Order Traversal of the binary tree
void levelOrderTraversal(Tnode* root) {
if (root == nullptr) {
return;
}
// Queue to hold nodes at each level
queue<Tnode*> q;
q.push(root);
while (!q.empty()) {
Tnode* currNode = q.front();
q.pop();
// Print the current node's data
cout << currNode->data << " ";
// Push the left and right children
// of the current node to the queue
if (currNode->left) {
q.push(currNode->left);
}
if (currNode->right) {
q.push(currNode->right);
}
}
}
int main() {
// Create linked list : 10->12->15->25->30->36
Lnode* head = new Lnode(10);
head->next = new Lnode(12);
head->next->next = new Lnode(15);
head->next->next->next = new Lnode(25);
head->next->next->next->next = new Lnode(30);
head->next->next->next->next->next = new Lnode(36);
Tnode* root = convert(head);
levelOrderTraversal(root);
return 0;
}
// Java program to create a Complete Binary tree
// from its Linked List Representation
import java.util.LinkedList;
import java.util.Queue;
class Lnode {
int data;
Lnode next;
Lnode(int value) {
data = value;
next = null;
}
}
class Tnode {
int data;
Tnode left, right;
Tnode(int value) {
data = value;
left = null;
right = null;
}
}
class GfG {
// Converts a given linked list representing a complete binary tree into the
// linked representation of a binary tree.
static Tnode convert(Lnode head) {
if (head == null) {
return null;
}
// Queue to store the parent nodes
Queue<Tnode> q = new LinkedList<>();
// The first node is always the root node,
// and add it to the queue
Tnode root = new Tnode(head.data);
q.add(root);
// Move the pointer to the next node
head = head.next;
// Until the end of the linked list is reached,
// do the following steps
while (head != null) {
// Take the parent node from the queue
// and remove it from the queue
Tnode parent = q.poll();
Tnode leftChild = null, rightChild = null;
// Create left child
if (head != null) {
leftChild = new Tnode(head.data);
q.add(leftChild);
head = head.next;
}
// Create right child
if (head != null) {
rightChild = new Tnode(head.data);
q.add(rightChild);
head = head.next;
}
// Assign the left and right children of the parent
parent.left = leftChild;
parent.right = rightChild;
}
return root;
}
// Level Order Traversal of the binary tree
static void levelOrderTraversal(Tnode root) {
if (root == null) {
return;
}
// Queue to hold nodes at each level
Queue<Tnode> q = new LinkedList<>();
q.add(root);
while (!q.isEmpty()) {
Tnode currNode = q.poll();
// Print the current node's data
System.out.print(currNode.data + " ");
// Push the left and right children
// of the current node to the queue
if (currNode.left != null) {
q.add(currNode.left);
}
if (currNode.right != null) {
q.add(currNode.right);
}
}
}
public static void main(String[] args) {
// Create linked list : 10->12->15->25->30->36
Lnode head = new Lnode(10);
head.next = new Lnode(12);
head.next.next = new Lnode(15);
head.next.next.next = new Lnode(25);
head.next.next.next.next = new Lnode(30);
head.next.next.next.next.next = new Lnode(36);
Tnode root = convert(head);
levelOrderTraversal(root);
}
}
# Python program to create a Complete Binary tree
# from its Linked List Representation
from collections import deque
class Lnode:
def __init__(self, value):
self.data = value
self.next = None
class Tnode:
def __init__(self, value):
self.data = value
self.left = None
self.right = None
# Converts a given linked list representing a complete
# binary tree into the linked representation of a binary tree.
def convert(head):
if not head:
return None
# Queue to store the parent nodes
q = deque()
# The first node is always the root node,
# and add it to the queue
root = Tnode(head.data)
q.append(root)
# Move the pointer to the next node
head = head.next
# Until the end of the linked list is reached,
# do the following steps
while head:
# Take the parent node from the queue
# and remove it from the queue
parent = q.popleft()
leftChild = None
rightChild = None
# Create left child
if head:
leftChild = Tnode(head.data)
q.append(leftChild)
head = head.next
# Create right child
if head:
rightChild = Tnode(head.data)
q.append(rightChild)
head = head.next
# Assign the left and right children of the parent
parent.left = leftChild
parent.right = rightChild
return root
# Level Order Traversal of the binary tree
def levelOrderTraversal(root):
if not root:
return
# Queue to hold nodes at each level
q = deque()
q.append(root)
while q:
currNode = q.popleft()
# Print the current node's data
print(currNode.data, end=" ")
# Push the left and right children
# of the current node to the queue
if currNode.left:
q.append(currNode.left)
if currNode.right:
q.append(currNode.right)
if __name__ == "__main__":
# Create linked list : 10->12->15->25->30->36
head = Lnode(10)
head.next = Lnode(12)
head.next.next = Lnode(15)
head.next.next.next = Lnode(25)
head.next.next.next.next = Lnode(30)
head.next.next.next.next.next = Lnode(36)
root = convert(head)
levelOrderTraversal(root)
// C# program to create a Complete Binary tree
// from its Linked List Representation
using System;
using System.Collections.Generic;
class Lnode {
public int data;
public Lnode next;
public Lnode(int value) {
data = value;
next = null;
}
}
class Tnode {
public int data;
public Tnode left, right;
public Tnode(int value) {
data = value;
left = null;
right = null;
}
}
class GfG {
// Converts a given linked list representing a complete binary tree into the
// linked representation of a binary tree.
static Tnode convert(Lnode head) {
if (head == null) {
return null;
}
// Queue to store the parent nodes
Queue<Tnode> q = new Queue<Tnode>();
// The first node is always the root node,
// and add it to the queue
Tnode root = new Tnode(head.data);
q.Enqueue(root);
// Move the pointer to the next node
head = head.next;
// Until the end of the linked list is reached,
// do the following steps
while (head != null) {
// Take the parent node from the queue
// and remove it from the queue
Tnode parent = q.Dequeue();
Tnode leftChild = null, rightChild = null;
// Create left child
if (head != null) {
leftChild = new Tnode(head.data);
q.Enqueue(leftChild);
head = head.next;
}
// Create right child
if (head != null) {
rightChild = new Tnode(head.data);
q.Enqueue(rightChild);
head = head.next;
}
// Assign the left and right children
// of the parent
parent.left = leftChild;
parent.right = rightChild;
}
return root;
}
// Level Order Traversal of the binary tree
static void LevelOrderTraversal(Tnode root) {
if (root == null) {
return;
}
// Queue to hold nodes at each level
Queue<Tnode> q = new Queue<Tnode>();
q.Enqueue(root);
while (q.Count > 0) {
Tnode currNode = q.Dequeue();
// Print the current node's data
Console.Write(currNode.data + " ");
// Push the left and right children
// of the current node to the queue
if (currNode.left != null) {
q.Enqueue(currNode.left);
}
if (currNode.right != null) {
q.Enqueue(currNode.right);
}
}
}
static void Main(string[] args) {
// Create linked list : 10->12->15->25->30->36
Lnode head = new Lnode(10);
head.next = new Lnode(12);
head.next.next = new Lnode(15);
head.next.next.next = new Lnode(25);
head.next.next.next.next = new Lnode(30);
head.next.next.next.next.next = new Lnode(36);
Tnode root = convert(head);
LevelOrderTraversal(root);
}
}
// JavaScript program to create a Complete Binary tree
// from its Linked List Representation
// Linked list node class
class Lnode {
constructor(value) {
this.data = value;
this.next = null;
}
}
// Binary tree node class
class Tnode {
constructor(value) {
this.data = value;
this.left = null;
this.right = null;
}
}
// Converts a given linked list representing a
// complete binary tree into the linked representation of a binary tree.
function convert(head) {
if (head === null) {
return null;
}
// Queue to store the parent nodes
let q = [];
// The first node is always the root node,
// and add it to the queue
let root = new Tnode(head.data);
q.push(root);
// Move the pointer to the next node
head = head.next;
// Until the end of the linked list is reached,
// do the following steps
while (head) {
// Take the parent node from the queue
// and remove it from the queue
let parent = q.shift();
let leftChild = null;
let rightChild = null;
// Create left child
if (head) {
leftChild = new Tnode(head.data);
q.push(leftChild);
head = head.next;
}
// Create right child
if (head) {
rightChild = new Tnode(head.data);
q.push(rightChild);
head = head.next;
}
// Assign the left and right
// children of the parent
parent.left = leftChild;
parent.right = rightChild;
}
return root;
}
// Level Order Traversal of the binary tree
function levelOrderTraversal(root) {
if (root === null) {
return;
}
// Queue to hold nodes at each level
let q = [];
q.push(root);
while (q.length > 0) {
let currNode = q.shift();
// Print the current node's data
console.log(currNode.data + " ");
// Push the left and right children
// of the current node to the queue
if (currNode.left) {
q.push(currNode.left);
}
if (currNode.right) {
q.push(currNode.right);
}
}
}
// Create linked list : 10->12->15->25->30->36
let head = new Lnode(10);
head.next = new Lnode(12);
head.next.next = new Lnode(15);
head.next.next.next = new Lnode(25);
head.next.next.next.next = new Lnode(30);
head.next.next.next.next.next = new Lnode(36);
let root = convert(head);
levelOrderTraversal(root);
Time Complexity: O(n), where n is the number of nodes.
Auxiliary Space: O(n), The queue stores at most n/2 nodes at any point, since for every node processed, its children are added to the queue. Therefore, the maximum space used by the queue is O(n).
Construct Complete Binary Tree from its Linked List Representation
Similar Reads
Basics & Prerequisites
Data Structures
Array Data StructureIn this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous
3 min read
String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut
2 min read
Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The
2 min read
Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Here’s the comparison of Linked List vs Arrays Linked List:
2 min read
Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first
2 min read
Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems
2 min read
Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most
4 min read
Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of
3 min read
Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this
15+ min read
Algorithms
Searching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input
2 min read
Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ
3 min read
Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution
14 min read
Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get
3 min read
Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net
3 min read
Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of
3 min read
Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit
4 min read
Advanced
Segment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree
3 min read
Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i
2 min read
GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br
2 min read
Interview Preparation
Practice Problem