Clone (Deep Copy) Binary Tree With Random Pointer using Hash Map and Recursion
A binary tree is given such that each node contains an additional random pointer which could point to any node in the tree or null. Return a deep copy …
Category: algorithms
How to Compute Running Sum of 1d Array using std::partial_sum in C++?
Given an array nums. We define a running sum of an array as runningSum = sum(nums…nums). Return the running sum of nums. Example 1: Input: nums = Output: Explanation: …
Recursive Algorithm to Construct Binary Tree from Preorder and Postorder Traversal
Return any binary tree that matches the given preorder and postorder traversals. Values in the traversals pre and post are distinct positive integers. Example 1: Input: pre = , …
How to Design a Browser History using Double-ended Queue (deque) in C++ ?
You have a browser of one tab where you start on the homepage and you can visit another url, get back in the history number of steps or move …
DFS and BFS Algorithms to Find All the Lonely Nodes of a Binary Tree
In a binary tree, a lonely node is a node that is the only child of its parent node. The root of the tree is not lonely because it …