## Find product of sums of data of leaves at same levels | Set 2

Given a Binary Tree, return following value for it. For every level, compute sum of all leaves if there are leaves at this level. Otherwise… Read More »

- Print nodes in top view of Binary Tree | Set 2
- OYO Rooms Interview Experience (On-Campus)
- Print nodes in the Top View of Binary Tree | Set 3
- Print the nodes of binary tree as they become the leaf node
- Shannon-Fano Algorithm for Data Compression
- Zig Zag Level order traversal of a tree using single queue
- MakeMyTrip Interview Experience 2019
- Preorder from Inorder and Postorder traversals
- HashSet vs TreeSet in Java
- Flatten a binary tree into linked list | Set-2
- Find the node with maximum value in a Binary Search Tree
- DFS traversal of a tree using recursion
- Print path between any two nodes in a Binary Tree
- Level Ancestor Problem
- Sandvine Interview Experience for FTE 2018
- 2-3 Trees | (Search and Insert)
- Shortest root to leaf path sum equal to a given number
- Print all nodes between two given levels in Binary Tree
- Print all even nodes of Binary Search Tree
- Insert a node in Binary Search Tree Iteratively
- Amadeus Labs R & D | On Campus (freshers) | Full time+Internship
- Search a node in Binary Tree
- Flatten a binary tree into linked list | Set-3
- Subtree of all nodes in a tree using DFS
- Find the maximum node at a given level in a binary tree
- Iterative Preorder Traversal of an N-ary Tree
- Counting inversions in an array using segment tree
- Count pairs in a binary tree whose sum is equal to a given value x
- Difference between graph and tree
- Check whether a given binary tree is skewed binary tree or not?

Given a Binary Tree, return following value for it. For every level, compute sum of all leaves if there are leaves at this level. Otherwise… Read More »

Given a complete binary tree, traverse it such that all the boundary nodes are visited in Anti-Clockwise order starting from the root. Example: Input: 18… Read More »

Given a Binary Tree. The task is to print the circular clockwise spiral order traversal of the given binary tree. For the above binary tree,… Read More »

I applied for SSE position (Gurgaon Location) There were three rounds.. First round: Data Structures And Problem solving https://www.geeksforgeeks.org/level-order-traversal-in-spiral-form/ https://www.geeksforgeeks.org/rotate-a-matrix-by-90-degree-in-clockwise-direction-without-using-any-extra-space/ https://www.geeksforgeeks.org/design-a-data-structure-that-supports-insert-delete-search-and-getrandom-in-constant-time/ Second Round: Problem solving/Project… Read More »

Given an array arr[] and an integer K, the task is to count the number of sub-arrays having bitwise OR ≥ K. Examples: Input: arr[]… Read More »

Given an infinite tree and three numbers N, M, and X which has exactly N child from every node. Every edge has a weight of… Read More »

Given a binary tree and a number, the task is to return the length of the shortest path beginning at root and ending at a… Read More »

Given the edges of a tree and a sum S. The task is to assign weights to the all the edges of the tree such… Read More »

Graph : A graph is collection of two sets V and E where V is a finite non-empty set of vertices and E is a… Read More »

Given a binary tree and an integer b representing budget. The task is to find the count of maximum number of leaf nodes that can… Read More »

Given an array of N integers, the task is to perform the following two operations on the given array: query(start, end) : Print the number… Read More »

Given a tree, where each vertex V has a value A[V] stored in it. The task is to find the minimum number of operations required… Read More »

Given a binary tree, flatten it into linked list in-place. Usage of auxiliary data structure is not allowed. After flattening, left of each node should… Read More »

Given an integer X and a binary tree, the task is to count the number of triplet triplets of nodes such that their sum is… Read More »

Given a character array a[] representing a prefix expression. The task is to build an Expression Tree for the expression and then print the infix… Read More »