Author1thy的博客

图： 代码： package com.wangyq.datastructrue.map; import java.util.Arrays; class Test { public static void main(String[] args) { //初始化图 Map map = new Map(5); //设置联通 map.setEdge(1, 2); map.setEdge(1, 3); map.

代码： package com.wangyq.datastructrue.tree; class BalancedBinaryTreeTest { public static void main(String[] args) { int[] ints = {1, 65, 64, 561, 213, 5479, 87465, 13, 9, 7984, 31, 234, 56, 13, 4, 7, 7, 8, 123, 12, 456, 567, 231, 41, 234, 6874,

代码： package com.wangyq.datastructrue.tree; public class OrderedTree { private static OrderedTreeNode rootNode; public static void main(String[] args) { int[] ints = {65, 64, 561, 213, 5479, 87465, 13, 9, 7984, 31, 6874, 51, 321, 84, 651,