import java.util.List
import java.util.LinkedList
public class Bintrees {
private int[] array = {1, 2, 3, 4, 5, 6, 7, 8, 9}
private static List<Node>nodeList = null
private static class Node {
Node leftChild
Node rightChild
int data
Node(int newData) {
leftChild = null
rightChild = null
data = newData
}
}
// 创建二叉树
public void createBintree() {
nodeList = new LinkedList<Node>()
// 将数组的值转换为node
for (int nodeIndex = 0nodeIndex <array.lengthnodeIndex++) {
nodeList.add(new Node(array[nodeIndex]))
}
// 对除最后一个父节点按照父节点和孩子节点的数字关系建立二叉树
for (int parentIndex = 0parentIndex <array.length / 2 - 1parentIndex++) {
nodeList.get(parentIndex).leftChild = nodeList.get(parentIndex * 2 + 1)
nodeList.get(parentIndex).rightChild = nodeList.get(parentIndex * 2 + 2)
}
// 最后一个父节点
int lastParentIndex = array.length / 2 - 1
// 左孩子
nodeList.get(lastParentIndex).leftChild = nodeList.get(lastParentIndex * 2 + 1)
// 如果为奇数,建立右孩子
if (array.length % 2 == 1) {
nodeList.get(lastParentIndex).rightChild = nodeList.get(lastParentIndex * 2 + 2)
}
}
// 前序遍历
public static void preOrderTraverse(Node node) {
if (node == null) {
return
}
System.out.print(node.data + " ")
preOrderTraverse(node.leftChild)
preOrderTraverse(node.rightChild)
}
// 中序遍历
public static void inOrderTraverse(Node node) {
if (node == null) {
return
}
inOrderTraverse(node.leftChild)
System.out.print(node.data + " ")
inOrderTraverse(node.rightChild)
}
// 后序遍历
public static void postOrderTraverse(Node node) {
if (node == null) {
return
}
postOrderTraverse(node.leftChild)
postOrderTraverse(node.rightChild)
System.out.print(node.data + " ")
}
public static void main(String[] args) {
Bintrees binTree = new Bintrees()
binTree.createBintree()
Node root = nodeList.get(0)
System.out.println("前序遍历:")
preOrderTraverse(root)
System.out.println()
System.out.println("中序遍历:")
inOrderTraverse(root)
System.out.println()
System.out.println("后序遍历:")
postOrderTraverse(root)
}
}
import java.util.ArrayListimport java.util.List
public class Test
{
/**
* @param args
*/
public static void main(String[] args)
{
// 创建一个顺序表
List<String>a = new ArrayList<String>()
a.add("a")
a.add("b")
a.add("c")
a.add("x")
a.add("d")
a.add("x")
// 按顺序输出创建的顺序表
for (int i = 0i <a.size()i++)
{
System.out.println("序号:" + i + ", 值:" + a.get(i))
}
// 循环替换x为y
for (int i = 0i <a.size()i++)
{
String value = a.get(i)
if ("x".equals(value))
{
a.set(i, "y")
}
}
// 按顺序输出替换后的顺序表
for (int i = 0i <a.size()i++)
{
System.out.println("序号:" + i + ", 值:" + a.get(i))
}
}
}