## Count of paths in given Binary Tree with odd bitwise AND for Q queries

Given an integer Q representing the number of queries and an array where each query has an integer N. Our task is to iterate through… Read More »

- Breadth First Search without using Queue
- Minimum time to burn a Tree starting from a Leaf node
- Print all nodes at distance K from given node: Iterative Approach
- Check if given words are present in a string
- Level order traversal in spiral form | Using Deque
- Check if a binary tree is subtree of another binary tree using preorder traversal : Iterative
- Find distance between two nodes in the given Binary tree for Q queries
- Print Palindromic Paths of Binary tree
- Split a BST into two balanced BSTs based on a value K
- Real-time application of Data Structures
- Sum of all nodes at Kth level in a Binary Tree
- Print all pairs from two BSTs whose sum is greater than the given value
- Boundary Level order traversal of a Binary Tree
- Diamond Tree
- Paranthesis Theorem
- Duplicates Removal in Array using BST
- Least Common Ancestor of any number of nodes in Binary Tree
- Deletion of a given node K in a Binary Tree using Level Order Traversal
- Dynamic Segment Trees : Online Queries for Range Sum with Point Updates
- Count the number of visible nodes in Binary Tree
- Check if a string is a scrambled form of another string
- Count nodes in the given tree whose weight is a fibonacci number
- XOR of elements in a given range with updates using Fenwick Tree
- Sum and Maximum of elements in array from [L, R] before and after updates
- Maximum pair sum in the given index ranges of an Array
- Find the maximum Even Digit Sum node in the given tree
- Print all Exponential Levels of a Binary Tree
- Shortest path in a directed graph by Dijkstra’s algorithm
- Range Sum and Update in Array : Segment Tree using Stack
- Check if Inorder traversal of a Binary Tree is palindrome or not

Given an integer Q representing the number of queries and an array where each query has an integer N. Our task is to iterate through… Read More »

Given a binary tree of N nodes, the task is to print level order traversal in a spiral form. In spiral form, nodes at the… Read More »

Given a N-ary tree consisting of N nodes and a matrix edges[][] consisting of N – 1 edges of the form (X, Y) denoting the… Read More »

Given two N-ary trees having M nodes each. Also, given their edges and their roots respectively. The task is to check if they are isomorphic… Read More »

Given a set of strings S and a string patt the task is to autocomplete the string patt to strings from S that have patt… Read More »

Given an N-Ary tree containing N nodes and an array weight [ ] that denotes the weight of the nodes which can be positive or… Read More »

Given an array arr[], the task is to count the number of the unique arrays can be formed by updating the elements of the given… Read More »

Given a set of strings str, the task is to print all the joints of the Trie constructed from the given set of strings. Joints… Read More »

Given a Binary Tree, the task is to check if the maximum sum level divides the binary tree into the two parts of two equal… Read More »

Double Threaded Binary Search Tree: is a binary search tree in which the nodes are not every left NULL pointer points to its inorder predecessor… Read More »

Given a directed graph and a source vertex in the graph, the task is to find the shortest distance and path from source to target… Read More »

Prerequisites: Binary Tree to Doubly Linked List Given a Binary Tree, the task is create a Balanced Binary Tree from all the leaf nodes of… Read More »

Given two strings A and B, the task is to split the string A into the minimum number of substrings such that each substring is… Read More »

Given a Binary Tree, the task is to convert the given Binary tree into Min-Max Product Tree and print the level-order sequence of the modified… Read More »

Given a binary tree of N nodes with odd value. The task is to check whether all the nodes of the tree can be represented… Read More »