How to Find Second Minimum Node In a Binary Tree (Java)?
Given a non-empty special binary tree consisting of nodes with the non-negative value, where each node in this tree has exactly two or zero sub-node. If the node has …
Category: algorithms
How to Convert BST to Greater Tree?
Given a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is changed to the original key plus sum of …
Algorithms: How to Find N-Repeated Element in Size 2N Array?
January 19, 2019
algorithms, data structure, Java, java, List / Array, programming languages
No Comments
In a array A of size 2N, there are N+1 unique elements, and exactly one of these elements is repeated N times. Return the element repeated N times. Example …
How to Mirror a Binary Tree?
Given a binary tree like this: 8 / \ 6 10 / \ / \ 5 7 9 11 Your task is to mirror it which becomes this: 8 …
How to Find the Kth Smallest Element in a BST Tree Using Java/C++?
Given a binary search tree, write a function kthSmallest to find the kth smallest element in it. You may assume k is always valid, 1 ≤ k ≤ BST’s …