Recent posts
How to check whether a binary tree is height balanced or not?
A height balanced binary tree is a binary tree in which the height of the left subtree and right subtree of any node does no…
Read more
Data Structure
What is Height Balanced Binary Tree
A height-balanced binary tree is defined as a binary tree in which the height of the left and the right subtree of any node …
Read more
Convert Binary Tree to Linked Lists by Depth
Given a binary tree, design an algorithm which creates a linked list of all the nodes at each depth (e.g., if you have a tre…
Read more
Minimal Height BST
Objective: Given a sorted array with unique elements, Create a binary search tree with minimal height.
Minimum height means w…
BFS and DFS Of A Directed Graph
Lets assume we have a directed graph like the below image. Now we need to traverse the graph from a starting index.
We can d…
Routes Between Two Nodes Of A Graph Using BFS And DFS
We can have a directed graph like the below image and our task will be to find if their's a path or route between two gi…
Read more
Depth Firsrt Search of a Binary Tree or DFS
In case of dfs we will go as deep as possible in the given tree. In BFS we have explored or processed the nodes at the same …
Read more
Social Plugin