Using the External Fan to Cool the Hot AMD Radeon HD 6700 Graphic Card
I recently replace my graphic card on my HPZ800 Server from NVIDA Quadro 2000D (which is mostly used on Servers – excellent for CAD but not so much for …
Algorithms to Compute the Dot Product of Two Sparse Vectors
Given two sparse vectors, compute their dot product. Implement class SparseVector: SparseVector(nums) Initializes the object with the vector nums dotProduct(vec) Compute the dot product between the instance of SparseVector …
Algorithms to Compute the Largest Time for Given Digits
Given an array of 4 digits, return the largest 24 hour time that can be made. The smallest 24 hour time is 00:00, and the largest is 23:59. Starting …
How to Use Hash Map to Count the Frequencies of Values and Iterate the Key-Value Pairs in AWK?
AWK is a powerful text-processing programming language. Given a multi-million lines of text file containing the following data – we want to know the frequencies the delegation at each …
Using the Windows Hardware Tool to Error Checking and Optimize Your HardDrives
I recently realised that the Harddrives will fail as a matter of time – and I was wondering how to check the health status of an existing drive. However, …
Finding the Predecessor and Successor Node of a Binary Search Tree
August 31, 2020
algorithms, Binary Tree, c / c++, C/C++, code, data structure, interviews, Java, programming languages, Python
6 Comments
A Binary Search Tree (BST) is a commonly used data structure that can be used to search for an item in O(LogN) time. A BST has the following characteristics: …