## Quad Tree

Quadtrees are trees used to efficiently store data of points on a two-dimensional space. In this tree, each node has at most four children. We… Read More »

- Check if given Preorder, Inorder and Postorder traversals are of same tree | Set 2
- Remove minimum elements from either side such that 2*min becomes more than max | Set 2
- Kth smallest element in a subarray
- Introduction to Data Structures | 10 most commonly used Data Structures
- Total number of possible Binary Search Trees using Catalan Number
- Iterative Postorder traversal | Set 3
- Convert a given Binary Tree to Circular Doubly Linked List | Set 2
- Adobe Interview Experience ( 3 Years Exp )
- LCA in a tree using Binary Lifting Technique
- Find the node with maximum value in a Binary Search Tree using recursion
- Spanning Tree With Maximum Degree (Using Kruskal's Algorithm)
- Sum of nodes in bottom view of Binary Tree
- Check if the given Binary Tree have a Subtree with equal no of 1's and 0's
- Print all leaf nodes of a binary tree from right to left
- Check if two nodes in a Binary Tree are siblings
- Create a mirror tree from the given binary tree
- Print Binary Tree levels in sorted order | Set 3 (Tree given as array)
- K-th ancestor of a node in Binary Tree | Set 3
- Print path from root to all nodes in a Complete Binary Tree
- Lazy Propagation in Segment Tree | Set 2
- Sum of nodes in top view of binary tree
- Pair with a given sum in BST | Set 2
- Maximum sub-tree sum in a Binary Tree such that the sub-tree is also a BST
- Check if the given binary tree has a sub-tree with equal no of 1's and 0's | Set 2
- Clockwise Spiral Traversal of Binary Tree | Set - 2
- Find the node with minimum value in a Binary Search Tree using recursion
- Minimum steps to color the tree with given colors
- Construct BST from its given level order traversal | Set-2
- Minimum sum path between two leaves of a binary tree
- Sum of the distances from every node to all other nodes is maximum

Quadtrees are trees used to efficiently store data of points on a two-dimensional space. In this tree, each node has at most four children. We… Read More »

I recently got an interview call from Amazon (Chennai) for the Kindle team. Here is my experience:- Round 1 – It was written round (Pen… Read More »

Left-Child Right-Sibling Representation is a different representation of an n-ary tree where instead of holding a reference to each and every child node, a node… Read More »

Given a Binary Tree, write a function to check whether the given Binary Tree is a prefect Binary Tree or not. A Binary tree is… Read More »

Given a Binary Tree, print the nodes level wise, each level on a new line. Output: 1 2 3 4 5 Recommended: Please solve it… Read More »

Given a binary tree, check whether it is a mirror of itself without recursion. Examples: Input : 1 / \ 2 2 / \ /… Read More »

Given a Binary Tree (Every node has at most 2 children) where each node has value either 0 or 1. Convert a given Binary tree… Read More »

Senior Android developer(4-8 years) Qualification & Experience- · 4-8 years of experience in software development · Experience in Mobile App development in Android is a… Read More »

Given a string that contains ternary expressions. The expressions may be nested, task is convert the given ternary expression to a binary Tree. Examples: Input… Read More »

Given a binary tree with the node structure containing a data part, left and right pointers and an arbitrary pointer(abtr). The node’s value can be… Read More »

Vmware conducted their online exam via hirepro. Round 1 : There were 3 sections quants, Technical questions and OOPs based questions, no section had negative… Read More »

An n-ary tree in computer science is a collection of nodes normally represented hierarchically in the following fashion. The tree starts at the root node.… Read More »

Telephonic Round: Given a 2D matrix with elements 1 and 0, where 1 is land and 0 is water. Find the number of islands. Design… Read More »

Given a Binary Tree, write a function that returns the size of the largest subtree which is also a Binary Search Tree (BST). If the… Read More »

Given A binary Tree, how do you count all the full nodes (Nodes which have both children as not NULL) without using recursion and with… Read More »