Binary tree 2

Question 1

What is Depth-first pre-order.

Answer 1

Visit the root then the sub-trees.

Question 2

What is Depth-first post-order.

Answer 2

Visit the sub-trees and then the root.

Question 3

What is Depth-first in-order.

Answer 3

This is usually for Binary Trees where there are two
sub-trees. Visit the left sub-tree, then the root and then the
right sub-tree.

Question 4

Recursive procedure for finding height of tree.

Answer 4

public int getHeight(BinaryTree n){
if (n == null){
return 0;
}
return max(getHeight(n.getLeft()), getHeight(n.getRight()) + 1;
}