题目描述
分别按照二叉树先序,中序和后序打印所有的节点
import java.util.*;
class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
}
public class Solution {
/**
*
* @param root TreeNode类 the root of binary tree
* @return int整型二维数组
*/
private int result[][] ;
private int pre = 0,mid = 0, post = 0;
public int[][] threeOrders (TreeNode root) {
// write code here
if(root==null){
return null;
}
int count = count(root);
result = new int [3][count];
order(root);
return result;
}
public int count(TreeNode node){
if(node == null) return 0;
return 1 + count(node.left)+count(node.right);
}
private void order (TreeNode node){
if(node == null) return;
result[0][pre++] = node.val;
if(node.left!=null) order(node.left);
result[1][mid++] = node.val;
if(node.right!=null) order(node.right);
result[2][post++] = node.val;
}
}