j18874964028sss的博客

import java.util.Scanner; public class TreePrinter { static TreePrinter mm = new TreePrinter(); public static void main(String[] args) { Scanner scanner = new Scanner(System.in); String A = sc

http://www.jianshu.com/p/0190985635eb package com.jiangshuai.test; import java.util.ArrayList; import java.util.Stack; public class Tree { private class TreeNode{ TreeNode left; TreeNode right

package com.jiangshuai.test; public class paixu { public static void main(String[] args){ int[] aa = {1,2,34,12,76,0,22}; maopao(aa); System.out.println(aa[0]); } private static void maopao(

二叉树面试中相关算法，java实现： package com.js; import java.util.LinkedList; import java.util.Stack; public class BinaryTree { public class TreeRoot{ int data; TreeRoot leftChild = null; TreeRoot rightCh