## Print all internal nodes of a Binary tree

Given a Binary tree, the task is to print all the internal nodes in a tree. An internal node is a node which carries at… Read More »

- MakeMyTrip Interview Experience 2019
- Print nodes in the Top View of Binary Tree | Set 3
- Print the nodes of binary tree as they become the leaf node
- Zig Zag Level order traversal of a tree using single queue
- DFS traversal of a tree using recursion
- Shannon-Fano Algorithm for Data Compression
- Find the node with maximum value in a Binary Search Tree
- Insert a node in Binary Search Tree Iteratively
- Print path between any two nodes in a Binary Tree
- Iterative Method To Print Left View of a Binary Tree
- 2-3 Trees | (Search and Insert)
- Print all even nodes of Binary Search Tree
- Search a node in Binary Tree
- Count the Number of Binary Search Trees present in a Binary Tree
- Shortest root to leaf path sum equal to a given number
- Level Ancestor Problem
- Flatten a binary tree into linked list | Set-3
- Print all nodes between two given levels in Binary Tree
- Difference between graph and tree
- Zig-Zag traversal of a Binary Tree using Recursion
- Sum of nodes at maximum depth of a Binary Tree | Set 2
- Check whether a given binary tree is skewed binary tree or not?
- Count all Grandparent-Parent-Child Triplets in a binary tree whose sum is greater than X
- Sandvine Interview Experience for FTE 2018
- Check if the given Binary Tree have a Subtree with equal no of 1's and 0's
- Preorder Traversal of N-ary Tree Without Recursion
- Counting inversions in an array using segment tree
- Number of subarrays have bitwise OR >= K
- Some Basic Theorems on Trees
- Clockwise Spiral Traversal of Binary Tree

Given a Binary tree, the task is to print all the internal nodes in a tree. An internal node is a node which carries at… Read More »

Given a tree of N nodes. The task is to form minimum number of groups of nodes such that every nodes belong to exactly one… Read More »

Given a Binary Tree, the task is to print the Reverse zigzag Order of the tree. Examples: Input: 1 / \ 2 3 / \… Read More »

Given the value of ‘N’ and ‘I’. Here, represents the number of internal nodes present in an N-ary tree and every node of the N-ary… Read More »

Given a Binary tree, print all the leaf nodes of a Binary tree at a given level L. Examples: Input: 1 / \ 2 3… Read More »

Given an integer N, the task is to construct a tree such that sum of for all ordered pairs (u, v) is maximum where u… Read More »

Given a binary tree with N nodes, in which each node value represents number of candies present at that node, and there are N candies… Read More »

Given a Binary Tree, print it’s left view. Left view of a Binary Tree is a set of nodes visible when tree is seen from… Read More »

Given a binary tree, the task is to print the sum of all the boundary nodes of the tree. Examples: Input: 1 / \ 2… Read More »

Given a root node to a tree, find the sum of all the leaf nodes which are at maximum depth from root node. Example: 1… Read More »

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 »