Tree: Level Order Traversal
Problem Statement :
Given a pointer to the root of a binary tree, you need to print the level order traversal of this tree. In level-order traversal, nodes are visited level by level from left to right. Complete the function levelOrder and print the values in a single line separated by a space. For example: 1 \ 2 \ 5 / \ 3 6 \ 4 For the above tree, the level order traversal is 1 -> 2 -> 5 -> 3 -> 6 -> 4. Input Format You are given a function, void levelOrder(Node * root) { } Constraints 1 < = Nodes in the tree <= 500 Output Format Print the values in a single line separated by a space.
Solution :
Solution in C :
In C ++ :
/*
struct node
{
int data;
node* left;
node* right;
}*/
int height(node * root)
{
if(!root)
return 0;
int lleft=height(root->left);
int rright=height(root->right);
if(lleft > rright)
return(lleft+1);
else
return (rright+1);
}
void level(node *root,int h){
if(!root)
return ;
if(h==1)
cout<<root->data<<" ";
level(root->left,h-1);
level(root->right,h-1);
}
void LevelOrder(node * root)
{
int n=height(root);
for(int i=1;i<=n;i++){
level(root,i);
}
}
In Java :
/*
class Node
int data;
Node left;
Node right;
*/
void LevelOrder(Node root)
{
Node last = root;
Queue<Node> q1 = new LinkedList<Node>();
Queue<Node> q2 = new LinkedList<Node>();
q1.add(root);
Node cur = null;
while (!q1.isEmpty() || !q2.isEmpty()) {
while (!q1.isEmpty()) {
cur = q1.poll();
if (cur.left != null) {
q2.add(cur.left);
}
if (cur.right != null) {
q2.add(cur.right);
}
System.out.print(cur.data + " ");
}
while (!q2.isEmpty()) {
cur = q2.poll();
if (cur.left != null) {
q1.add(cur.left);
}
if (cur.right != null) {
q1.add(cur.right);
}
System.out.print(cur.data + " ");
}
}
}
In python3 :
"""
Node is defined as
self.left (the left child of the node)
self.right (the right child of the node)
self.info (the value of the node)
"""
def levelOrder(root):
myQ = [root]
while(len(myQ) > 0):
iter = myQ.pop(0)
print(iter.info,end = " ")
if (iter.left != None):
myQ.append(iter.left)
if (iter.right != None):
myQ.append(iter.right)
In C :
/* you only have to complete the function given below.
node is defined as
struct node {
int data;
struct node *left;
struct node *right;
};
*/int height(struct node* root)
{
if(!root)
return 0;
else
{
int rl=height(root->left);
int rr=height(root->right);
if(rl>rr)
return rl+1;
else
return rr+1;
}
}void printlevelorder(struct node* root,int level)
{
if(!root)
return;
else if(level==1)
printf("%d ",root->data);
else if(level>1)
{
printlevelorder(root->left,level-1);
printlevelorder(root->right,level-1);
}
}
void levelOrder( struct node *root) {
int h=height(root);
int i;
for(i=0;i<=h;i++)
{
printlevelorder(root,i);
}
}
View More Similar Problems
Left Rotation
A left rotation operation on an array of size n shifts each of the array's elements 1 unit to the left. Given an integer, d, rotate the array that many steps left and return the result. Example: d=2 arr=[1,2,3,4,5] After 2 rotations, arr'=[3,4,5,1,2]. Function Description: Complete the rotateLeft function in the editor below. rotateLeft has the following parameters: 1. int d
View Solution →Sparse Arrays
There is a collection of input strings and a collection of query strings. For each query string, determine how many times it occurs in the list of input strings. Return an array of the results. Example: strings=['ab', 'ab', 'abc'] queries=['ab', 'abc', 'bc'] There are instances of 'ab', 1 of 'abc' and 0 of 'bc'. For each query, add an element to the return array, results=[2,1,0]. Fun
View Solution →Array Manipulation
Starting with a 1-indexed array of zeros and a list of operations, for each operation add a value to each of the array element between two given indices, inclusive. Once all operations have been performed, return the maximum value in the array. Example: n=10 queries=[[1,5,3], [4,8,7], [6,9,1]] Queries are interpreted as follows: a b k 1 5 3 4 8 7 6 9 1 Add the valu
View Solution →Print the Elements of a Linked List
This is an to practice traversing a linked list. Given a pointer to the head node of a linked list, print each node's data element, one per line. If the head pointer is null (indicating the list is empty), there is nothing to print. Function Description: Complete the printLinkedList function in the editor below. printLinkedList has the following parameter(s): 1.SinglyLinkedListNode
View Solution →Insert a Node at the Tail of a Linked List
You are given the pointer to the head node of a linked list and an integer to add to the list. Create a new node with the given integer. Insert this node at the tail of the linked list and return the head node of the linked list formed after inserting this new node. The given head pointer may be null, meaning that the initial list is empty. Input Format: You have to complete the SinglyLink
View Solution →Insert a Node at the head of a Linked List
Given a pointer to the head of a linked list, insert a new node before the head. The next value in the new node should point to head and the data value should be replaced with a given value. Return a reference to the new head of the list. The head pointer given may be null meaning that the initial list is empty. Function Description: Complete the function insertNodeAtHead in the editor below
View Solution →