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: recursive
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 = , …
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 …
Depth First Search Algorithm to Compute the Smallest String Starting From Leaf
Given the root of a binary tree, each node has a value from 0 to 25 representing the letters ‘a’ to ‘z’: a value of 0 represents ‘a’, a …
Depth First Search Algoritm to Compute The k-th Lexicographical String of All Happy Strings of Length n
A happy string is a string that: consists only of letters of the set . s != s for all values of i from 1 to s.length – 1 …