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 …
Category: DFS
Sum Up Tree/Sub-Tree Values – Compute Employee Importance via DFS or BFS
You are given a data structu re of employee information, which includes the employee’s unique id, his importance value and his direct subordinates’ id. For example, employee 1 is …
Finding Two Numbers of Given Sum in Binary Search Tree
Given a binary search tree and a target, find out if there are any two numbers in the BST that sums up to this target. Given a Binary Search …
How to Find the Mode in a Binary Search Tree?
October 28, 2018
algorithms, BFS, c / c++, code, coding exercise, data structure, DFS, programming languages
No Comments
Given a BST (Binary Search Tree) with duplicates, find its mode(s) – the most frequently occurred element. A BST has the following characteristics: The left subtree of a node …
C++ Coding Exercise – Find Letter Case Permutation with DFS
Given a string S, we can transform every letter individually to be lowercase or uppercase to create another string. Return a list of all possible strings we could create. …