摘要: public class Node {String value;List<Node> children = new ArrayList<Node>();public Node(String value){this.value = value;}public static void main(Stri 阅读全文
posted @ 2016-03-24 15:00 有梦就能实现 阅读(1342) 评论(0) 推荐(0) 编辑
摘要: java遍历树如现有以下一颗树:A B B1 B11 B2 B22 C C1 C11 C12 C2 D D1 D11第一种方式深度优先遍历 (最终... 阅读全文
posted @ 2016-03-24 14:55 有梦就能实现 阅读(3372) 评论(0) 推荐(0) 编辑
摘要: 题目原型: Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root) 阅读全文
posted @ 2016-03-24 12:28 有梦就能实现 阅读(643) 评论(0) 推荐(0) 编辑
摘要: /** * 实现二叉树的创建、前序遍历、中序遍历和后序遍历 **/ package DataStructure; /** * Copyright 2014 by Ruiqin Sun * All right reserved * created on 2014-9-9 下午2:34:15 **/ public class BinTreeInt { private Node ro... 阅读全文
posted @ 2016-03-24 10:59 有梦就能实现 阅读(499) 评论(0) 推荐(0) 编辑