Longest consecutive path in a Binary tree
Given a Binary tree, write code to find the length of longest path such that value of node in that path are consecutive and in decreasing order. For example is the tree is Then output should be: 3 because path (5, 4, 3) has all nodes in consecutively decreasing order. Note that Path <5, 6, 7> are […]
Sum of all nodes at a vertical level
Given a binary tree and a number n representing the vertical level. Write code to compute the sum of all nodes which are at vertical level n. For example, if the binary tree given is as below: and n=-1, then the output should be 12. Because Nodes at level =1 are 7 and 5 and […]
Vertical distance of a Node from root
Given a Binary Tree and a Node, Write a function that return the vertical distance of that node from root of the tree. The vertical distance of a node is computed as below: Then the vertical distance of root is 0. The vertical distance of right node is distance of root+1. The vertical distance of […]
Check if a subtree exist with a given sum
Given a binary tree and a Number N, write code to check if there exist a subtree of the Binary tree with sum of all the nodes = N. For example, if the Binary tree is as given on the right: And N = 12, then the output should be ‘true’ because there exist a […]
Binary Heap
Binary heap is used to implement Priority queue. It is an array object, visualized as an almost complete binary tree. Binary heap comes in two flavours Max-Heap Min-Heap A max-heap is an almost complete binary tree, where, value at each node is greater than the value of its children. Similarly, a min-heap is an almost complete binary tree where […]
Count all left nodes in a Binary tree
One way to ask this question is: Given a Binary tree that represent a family hierarchy. A parent can have at most two children (at most one girl child and at most one boy child). A girl child (if present) is always represented as left child in the binary tree, and a boy child (if present) […]
Check if a Binary Tree is Complete Binary Tree – Video
This is video discussion of a typical interview problem to check if the given Binary tree is a complete Binary tree or not.
Check if all leaf nodes are at the same level – video
This is the video of a typical interview problem to Check if all leaf nodes in a Binary tree are at the same level.
Check if all leaf nodes are at the same level
Given a binary tree write a function to check if all leaf nodes of the tree are at the same level. For example, In all the below trees, the leaf nodes are at same level: But in the below tree the leaf nodes are not at the same level: A A A / \ / […]
Check if a Binary Tree is Complete Binary Tree
A Complete Binary Tree is a Binary Tree where each level is completely filled. For example, all the trees below are complete Binary trees Height=1 Height=2 Height=3 ——– ——– ——– A A A / \ / \ B C B C / \ / \ D E F G And the trees below are not […]
