Tree : Top View
Problem Statement :
Given a pointer to the root of a binary tree, print the top view of the binary tree.
The tree as seen from the top the nodes, is called the top view of the tree.
For example :
1
\
2
\
5
/ \
3 6
\
4
Top View : 1 -> 2 -> 5 -> 6
Complete the function topView and print the resulting values on a single line separated by space.
Input Format
You are given a function,
void topView(node * root) {
}
Constraints
1 <= Nodes in the tree <= 500
Output Format
Print the values on a single line separated by space.
Solution :
Solution in C :
In C++ :
/*
struct node
{
int data;
node* left;
node* right;
};
*/
int w_min=-1,w_max=1,w=0;
void inorder(node *root,int w)
{
if(root==NULL) return;
if(w<w_min) w_min=w;
if(w>w_max) w_max=w;
if(root->left!=NULL) inorder(root->left,w-1);
if(root->right!=NULL) inorder(root->right,w+1);
}
void top(node *root,int arr[],int w,int h,int arr2[])
{
if(root==NULL) return;
if(arr[w-w_min]==0 || h<arr2[w-w_min])
{
arr2[w-w_min]=h;
arr[w-w_min]=root->data;
}
if(root->left!=NULL) top(root->left,arr,w-1,h+1,arr2);
if(root->right!=NULL) top(root->right,arr,w+1,h+1,arr2);
}
void top_view(node * root)
{
inorder(root,0);
int arr[w_max-w_min+1],arr1[w_max-w_min+1];
for(int i=0;i<w_max-w_min+1;i++)
{
arr[i]=0;
arr1[i]=90;
}
top(root,arr,0,1,arr1);
for(int i=0;i<w_max-w_min+1;i++)
{
cout<<arr[i]<<" ";
}
}
In Java :
/*
class Node
int data;
Node left;
Node right;
*/
void top_view(Node root)
{
if(root==null)
return;
Stack st=new Stack();
int size=0;
int arr[]=new int[100];
Node Left=null,Right=null;
Left=root.left;
Right=root.right;
while(Right!=null)
{
arr[size]=Right.data;
size++;
Right=Right.right;
if(Right==null)
{
for(int i=size-1;i>=0;i--)
{
st.push(arr[i]);
}
}
}
st.push(root.data);
while(Left!=null)
{
st.push(Left.data);
Left=Left.left;
}
while(st.isEmpty()!=true)
{
System.out.print(st.pop()+" ");
}
}
In pytho3 :
"""
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)
"""
from collections import defaultdict
def topView(root):
# Write your code here
if root is None:
return None
queue = [(root, 0)]
hashtable = defaultdict(list)
for node, level in queue:
if node is not None:
hashtable[level].append(node.info)
if node.left is not None:
queue.extend([(node.left, level - 1)])
if node.right is not None:
queue.extend([(node.right, level + 1)])
if hashtable:
for level in range(min(hashtable.keys()),
max(hashtable.keys()) + 1):
print(hashtable[level][0], end=' ')
else:
return None
In C :
/*
struct node
{
int data;
node* left;
node* right;
};
*/
struct node2
{
struct node2* next;
struct node2* prev;
struct node* data;
int idx;
};
typedef struct{
int size;
struct node2* front;
struct node2* rear;
}queue;
struct node2* CreateNode(struct node * data, int idx)
{
struct node2* n;
// n = (struct node2*)malloc(sizeof(struct node2));
// n->data = (struct node*)malloc(sizeof(struct node));
// n->next = NULL;
// n->prev = NULL;
// n->idx = idx;
struct node2* node2 = (struct node2*)malloc(sizeof(struct node2));
node2->idx = idx;
node2->prev = NULL;
node2->next = NULL;
node2->data = data;
return node2;
}
queue CreateQueue()
{
queue q;
q.size = 0;
q.front = NULL;
q.rear = NULL;
return q;
}
void
Enqueue(queue *q, struct node * data, int idx)
{
struct node2* n = CreateNode(data, idx);
if(q->front == NULL)
q->front = q->rear = n;
else
{
q->rear->next = n;
q->rear = n;
}
q->size++;
}
struct node2*
Dequeue(queue *q)
{
if(q->size <= 0)
return NULL;
struct node2* del = q->front;
q->front = q->front->next;
q->size--;
return del;
}
int
IsQueueEmpty(queue *q)
{
return q == NULL || q->size == 0;
}
void topView(struct node * root) {
int *a, i, arr_size, idx;
arr_size = 1001;
idx = 500;
struct node2 *curr;
a = (int*)calloc(arr_size, sizeof(int));
for (i = 0; i < arr_size; i ++) {
a[i] = -1;
}
queue que = CreateQueue();
Enqueue(&que, root, idx);
while (!IsQueueEmpty(&que)) {
curr = Dequeue(&que);
if (a[curr->idx] == -1) {
a[curr->idx] = (int)curr->data->data;
}
if (curr->data->left != NULL) {
Enqueue(&que, curr->data->left, curr->idx -1);
}
if (curr->data->right != NULL) {
Enqueue(&que, curr->data->right, curr->idx +1);
}
}
for (i = 0; i < 1001; i++) {
if (a[i] != -1){
printf("%d ", a[i]);
}
}
// if (root == NULL) {
// return;
// }
// if (a[idx] == -1) {
// a[idx] = root->data;
// }
// traverse(root->left; a; idx - 1);
// traverse(root->right; a; idx + 1);
}
View More Similar Problems
Find the Running Median
The median of a set of integers is the midpoint value of the data set for which an equal number of integers are less than and greater than the value. To find the median, you must first sort your set of integers in non-decreasing order, then: If your set contains an odd number of elements, the median is the middle element of the sorted sample. In the sorted set { 1, 2, 3 } , 2 is the median.
View Solution →Minimum Average Waiting Time
Tieu owns a pizza restaurant and he manages it in his own way. While in a normal restaurant, a customer is served by following the first-come, first-served rule, Tieu simply minimizes the average waiting time of his customers. So he gets to decide who is served first, regardless of how sooner or later a person comes. Different kinds of pizzas take different amounts of time to cook. Also, once h
View Solution →Merging Communities
People connect with each other in a social network. A connection between Person I and Person J is represented as . When two persons belonging to different communities connect, the net effect is the merger of both communities which I and J belongs to. At the beginning, there are N people representing N communities. Suppose person 1 and 2 connected and later 2 and 3 connected, then ,1 , 2 and 3 w
View Solution →Components in a graph
There are 2 * N nodes in an undirected graph, and a number of edges connecting some nodes. In each edge, the first value will be between 1 and N, inclusive. The second node will be between N + 1 and , 2 * N inclusive. Given a list of edges, determine the size of the smallest and largest connected components that have or more nodes. A node can have any number of connections. The highest node valu
View Solution →Kundu and Tree
Kundu is true tree lover. Tree is a connected graph having N vertices and N-1 edges. Today when he got a tree, he colored each edge with one of either red(r) or black(b) color. He is interested in knowing how many triplets(a,b,c) of vertices are there , such that, there is atleast one edge having red color on all the three paths i.e. from vertex a to b, vertex b to c and vertex c to a . Note that
View Solution →Super Maximum Cost Queries
Victoria has a tree, T , consisting of N nodes numbered from 1 to N. Each edge from node Ui to Vi in tree T has an integer weight, Wi. Let's define the cost, C, of a path from some node X to some other node Y as the maximum weight ( W ) for any edge in the unique path from node X to Y node . Victoria wants your help processing Q queries on tree T, where each query contains 2 integers, L and
View Solution →