Recursive Depth First Search Algorithm to Diagonal Tree Traversal
Given a binary tree root, return the sum of each of the diagonals in the tree starting from the top to bottom right. For example, given 1 / \ …
Author: ACMer
Depth First Search Algorithm (Preorder Traversal) to Compute the Kth Smallest in a Binary Search Tree
Given a binary search tree root, and k return the kth (0-indexed) smallest value in root. It is guaranteed that the tree has at least k + 1 nodes. …
C++ Implementation of Trie Data Structure using Hash Map
Trie is a useful data structure allow us to search a given word or check if any words start with prefix in O(N) efficient time. The following is the …
Recursive Algorithm to Compute the Linked List Jumps
You are given a singly linked list node containing positive integers. Return the same linked list where every node’s next points to the node val nodes ahead. If there’s …
Recursive Algorithm to Delete a Node from a Singly Linked List
Given a singly linked list node, and an integer target, return the same linked list with all nodes whose value is target removed. Example 1 Input node = 0 …