## Root to leaf path product equal to a given number

Given a binary tree and a number, return true if the tree has a root-to-leaf path such that product of all the values along that… Read More »

- Tree Traversals (Inorder, Preorder and Postorder)
- Level Order Tree Traversal
- Binary Tree | Set 1 (Introduction)
- Lowest Common Ancestor in a Binary Tree | Set 1
- AVL Tree | Set 1 (Insertion)
- A program to check if a binary tree is BST or not
- Inorder Tree Traversal without Recursion
- Insertion in a Binary Tree in level order
- Binary Tree | Set 2 (Properties)
- Segment Tree | Set 1 (Sum of given range)
- BFS vs DFS for Binary Tree
- Binary Tree | Set 3 (Types of Binary Tree)
- Write a Program to Find the Maximum Depth or Height of a Tree
- Check if a given array can represent Preorder Traversal of Binary Search Tree
- Construct Tree from given Inorder and Preorder traversals
- Find distance between two nodes of a Binary Tree
- Diameter of a Binary Tree
- Print a Binary Tree in Vertical Order | Set 2 (Map based Method)
- Bottom View of a Binary Tree
- Print Left View of a Binary Tree
- Lowest Common Ancestor in a Binary Search Tree.
- Level order traversal in spiral form
- Inorder Tree Traversal without recursion and without stack!
- How to determine if a binary tree is height-balanced?
- Print Nodes in Top View of Binary Tree
- Sum of leaf nodes at minimum level
- Handshaking Lemma and Interesting Tree Properties
- Deletion in a Binary Tree
- Convert a Binary Tree into its Mirror Tree
- Find the maximum path sum between two leaves of a binary tree

Given a binary tree and a number, return true if the tree has a root-to-leaf path such that product of all the values along that… Read More »

Given a tree, with N nodes and E edges (every edge is denoted by two integers, X, Y stating that X is the parent of… Read More »

Given an array of integers arr, the task is to count the number of inversions in the array. If A[i] > A[j] and i <… Read More »

Tree:- A connected graph without any circuit is called a Tree. In other words, a tree is an undirected graph G that satisfies any of… Read More »

Given a binary tree, print all nodes between two given levels in a binary tree. Print the nodes level wise, i.e., the nodes for any… Read More »

Given a tree check if it is linear or not. 1 / \ 2 3 Linear as we can form a lime 2 1 3… Read More »

Given N and K, print a tree such that the tree has no more than K leaf nodes and every other node has at least… Read More »

Given a Binary Search Tree, the task is to find the node with the maximum value in a BST. For the above tree, we start… Read More »

Given a Binary Search Tree. The task is to find the sum and product of maximum and minimum value of tree. For the above tree,… Read More »

Given a Binary Tree. The task is to find the sum and product of maximum and minimum element in it. For example, sum of the… Read More »

Top view of a binary tree is the set of nodes visible when the tree is viewed from the top. Given a binary tree, print… Read More »

Pre-Requisites: Depth First Search | Parent Array Representation Given a parent array representation of a binary tree, we need to find the number of Isosceles… Read More »

Given a Binary tree. The task is to find and print the product and sum of all internal nodes (non-leaf nodes) in the tree. In… Read More »

Given a Binary Tree. The task is to write a program to find the product of all of the nodes of the given binary tree.… Read More »

Given a binary search tree. The task is to print all even nodes of the binary search tree. Examples: Input : 5 / \ 3… Read More »