## Find the root of the sub-tree whose weighted sum XOR with X is minimum

Given a tree, and the weights of all the nodes, the task is to find the root of the sub-tree whose weighted sum XOR with… Read More »

- Count the Number of Binary Search Trees present in a Binary Tree
- 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
- Reverse Level Order traversal in spiral form
- 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
- Minimum steps to color the tree with given colors
- Find the node with minimum value in a Binary Search Tree using recursion
- Minimum sum path between two leaves of a binary tree

Given a tree, and the weights of all the nodes, the task is to find the root of the sub-tree whose weighted sum XOR with… Read More »

Given a tree, and the weights of all the nodes and an integer X, the task is to count all the nodes i such that… Read More »

Given a tree, and the weights of all the nodes, the task is to count the number of nodes whose weight is even. Examples: Input:… Read More »

Given a tree, and the weights of all the nodes, the task is to count the number of nodes whose weight is prime. Examples: Input:… Read More »

Given a perfect binary tree of N nodes, with nodes having values from 1 to N as depicted in the image below and Q queries… Read More »

Given a tree, and the weights of all the nodes, the task is to count the number of nodes whose weight is a perfect Square.… Read More »

Given a tree, and the weights of all the nodes and an integer x, the task is to find a node i such that weight[i]… Read More »

Given a tree, and the weights of all the nodes and an integer x, the task is to find a node i such that |weight[i]… Read More »

Given a complete binary tree of depth H. If the mirror image from the left and the right side of this tree is taken then:… Read More »

I was called to Noida office of Adobe situated in sector 132 Noida. Round 1: Remove half nodes from a binary tree. (Half Nodes =… Read More »

Given an N-ary tree and an array val[] which stores the values associated with all the nodes. Also given are a leaf node X and… Read More »

Given an array of size N, initially consists of zeroes only. The task is to apply given operation q times and find the number of… Read More »