Remove a node (and nodes belong to that subtree) from a Tree is the same as The Process Killing Algorithms using Depth First Search or Breadth First Search (Kill …
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 …
In a binary tree, the root node is at depth 0, and children of each depth k node are at depth k+1. Two nodes of a binary tree are …
Given a list of rules in the form of “A-B”, find out the original word. The original word only has unique letters. For example, given , return the original …
You are given an array prices where prices is the price of a given stock on the ith day. You want to maximize your profit by choosing a single …
Introduction to Hanoi Tower Problem Hanoi Tower is a famous math puzzle. There are three rods and N disks. The smaller size of disks need to be always ontop …