is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.
CareerCup's interview videos give you a real-life look at technical interviews. In these unscripted videos, watch how other candidates handle tough questions and how the interviewer thinks about their performance.
Most engineers make critical mistakes on their resumes -- we can fix your resume with our custom resume review service. And, we use fellow engineers as our resume reviewers, so you can be sure that we "get" what you're saying.
Our Mock Interviews will be conducted "in character" just like a real interview, and can focus on whatever topics you want. All our interviewers have worked for Microsoft, Google or Amazon, you know you'll get a true-to-life experience.
public class TreeQns {
- Guru March 30, 2018public static Tree BuildTree(int[] input, int start , int end)
{
if(end < start)
{
return null;
}
int mid = start + (end-start)/2;
Tree root = new Tree(input[mid]);
root.left = BuildTree(input, start, mid-1);
root.right = BuildTree(input, mid+1, end);
return root;
}
public static void PrintInorderH(Tree root)
{
if(root == null)
{
return;
}
PrintInorderH(root.left);
System.out.print(" " + root.info);
PrintInorderH(root.right);
}
public static void PrintInorder(Tree root)
{
PrintInorderH(root);
System.out.println();
}
public static void DeleteNodes(Tree root)
{
if(root == null)
{
return;
}
DeleteNodes(root.left);
root.left = null;
DeleteNodes(root.right);
root.right = null;
}
public static void DeleteNodes(Tree root, int nodeInfo)
{
if(root == null)
{
return;
}
if(root.left != null && root.left.info == nodeInfo)
{
DeleteNodes(root);
return;
}
if(root.right != null && root.right.info == nodeInfo)
{
DeleteNodes(root);
return;
}
DeleteNodes(root.left, nodeInfo);
DeleteNodes(root.right, nodeInfo);
}
public static void main(String[] args)
{
int[] in = new int[] { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11};
Tree root = BuildTree(in, 0, in.length-1);
System.out.println("ROOT " + root.info);
PrintInorder(root);
DeleteNodes(root, 7);
PrintInorder(root);
in = new int[] { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11};
root = BuildTree(in, 0, in.length-1);
DeleteNodes(root, 4);
PrintInorder(root);
}
}
class Tree {
public int info;
public Tree left;
public Tree right;
public Tree(int info)
{
this.info = info;
this.left = null;
this.right = null;
}
}