### Binary Tree Interview Questions

No. 01 - Binary Search Tree and Double-linked List
Convert a binary search tree to a sorted double-linked list. We can only change the target of pointers, but cannot create any new nodes.

No. 04 - Paths with Specified Sum in Binary Tree
All nodes along children pointers from root to leaf nodes form a path in a binary tree. Given a binary tree and a number, please print out all of paths where the sum of all nodes value is same as the given number.

No. 06 - Post-order Traversal Sequences of Binary Search Trees
Determine whether an input array is a post-order traversal sequence of a binary tree or not. If it is, return true; otherwise return false. Assume all numbers in an input array are unique.

No. 31 - Binary Search Tree Verification
How to verify whether a binary tree is a binary search tree?

No. 45 - Closest Node in a Binary Search Tree
Given a binary search tree and a value k, please find a node in the binary search tree whose value is closest to k.

Given a binary search tree, please check whether there are two nodes in it whose sum equals a given value.

1. Tks very much for your post.

Avoid surprises — interviews need preparation. Some questions come up time and time again — usually about you, your experience and the job itself. We've gathered together the most common questions so you can get your preparation off to a flying start.

You also find all interview questions at link at the end of this post.

Best rgs

2. Very much useful article. Kindly keep blogging

Java Training in Chennai

Java Online Training India

3. Ni Hau,

Your blog is such a complete read. I like your approach with Binary Tree Interview Questions. Clearly, you wrote it to make learning a cake walk for me.

I want to make a dynamic array of char* returned by a function. I need to save the name of files contained inside a folder to a dynamic array of char*.
My IDE is dev-c++, my favorite, my language is C.

If the data is expensive to compare, the number of comparisons used even by a binary search might be too many. So instead of looking at the data themselves, you’ll condense (hash) the data to an integer (its hash value) and keep all the data with the same hash value in the same place. This task is carried out by using the hash value as an index into an array.

Awesome! Thanks for putting this all in one place. Very useful!

Thanks a heaps,
Micheal

2. which traversal is same in a binary tree and its mirror image

1. Postorder traversal

3. http://binarytreeinterview.blogspot.com/

1. This blog is removed. can you share if you have saved the blog somewhere

5. I wanna say PROFIT MAXIMIZER system is best of the best automated binary signal provider bot.If you use it for once, you can automatically understand the truth! Personally i inspired and benefited by this video >>> ProfitMaximizer

6. Tks very much for your post.

Avoid surprises — interviews need preparation. Some questions come up time and time again — usually about you, your experience and the job itself. We've gathered together the most common questions so you can get your preparation off to a flying start.

You also find all interview questions at link at the end of this post.

Best rgs

BSTNodetest = inorder2(root);

while (test != null ) {

System.out.println(test.data);
test = test.left;
}
return null;

}

public BSTNode inorder2(BSTNode node) {

if (node.left == null && node.right == null) {

return node;
}

BSTNode nodeLeft = inorder2(node.left);
nodeLeft.right = node;

BSTNode nodeRight = inorder2(node.right);
nodeRight.left = node;

return nodeRight;

}

BSTNodetest = inorder2(root);

while (test != null ) {

System.out.println(test.data);
test = test.left;
}
return null;

}

public BSTNode inorder2(BSTNode node) {

if (node.left == null && node.right == null) {

return node;
}

BSTNode nodeLeft = inorder2(node.left);
nodeLeft.right = node;

BSTNode nodeRight = inorder2(node.right);
nodeRight.left = node;

return nodeRight;

}

9. Tks very much for your post.

Avoid surprises — interviews need preparation. Some questions come up time and time again — usually about you, your experience and the job itself. We've gathered together the most common questions so you can get your preparation off to a flying start.

You also find all interview questions at link at the end of this post.

Best rgs

10. There are so many programming language that require interview questions and answers for the people. Knowing the job interview question and answers enables you to give well thought out answers promptly to make yourself shine out from your competition.

11. Awesome. I am a beginner and this article helped me to resolve the problem .Thank you author and the whole expect team.

http://www.wikitechy.com/view-article/simple-program-for-multiple-inheritance-using-cpp-with-example

Both are really good,
Cheers,
Venkat