java二叉树代码_与二叉树有关的编程题的Java代码实现

packagetest;importjava.util.ArrayList;importjava.util.Comparator;importjava.util.LinkedList;importjava.util.PriorityQueue;importjava.util.Queue;importorg.junit.Test;classTreeNode {int val = 0;

TreeNode left= null;

TreeNode right= null;public TreeNode(intval) {this.val =val;

}

}public classSolution {/*** 二叉树的前序序列化

*

*@paramroot

*@return

*/String Serialize(TreeNode root) {if (root == null)return null;

StringBuilder str= newStringBuilder();

SerializeRe(root, str);returnstr.toString();

}/*** 二叉树的前序序列化递归方法

*

*@paramroot

*@paramstr*/

public voidSerializeRe(TreeNode root, StringBuilder str) {if (root == null) {

str.append("#,");return;

}else{

str.append(root.val);

str.append(",");

SerializeRe(root.left, str);

SerializeRe(root.right, str);

}return;

}/*** 前序反序列化

*

*@paramstr

*@return

*/TreeNode Deserialize(String str) {if (str == null || str.length() == 0 || str.equals("#"))return null;

String[] value= str.split(",");returnDeserializeRe(value);

}int index = 0;/*** 前序反序列化递归方法

*

*@paramstr

*@return

*/

publicTreeNode DeserializeRe(String[] str) {

TreeNode root= new TreeNode(-1);if (str[index].equals("#") || index >str.length) {return null;

}

root.val=Integer.valueOf(str[index]);

index++;

root.left=DeserializeRe(str);

index++;

root.right=DeserializeRe(str);returnroot;

}/*** 根据数组从上到下构造一棵二叉树(即完全二叉树)

*

*@parama

*@paramindex

*@return

*/

public TreeNode buildTreeLevel(int[] a) {if (a == null || a.length == 0)return null;return buildTreeLevelRe(a, 0);

}private TreeNode buildTreeLevelRe(int[] a, intindex) {

TreeNode root= new TreeNode(-1);

root.val=a[index];if (index * 2 + 1 <= a.length - 1) {

root.left= buildTreeLevelRe(a, index * 2 + 1);

}if (index * 2 + 2 <= a.length - 1) {

root.right= buildTreeLevelRe(a, index * 2 + 2);

}returnroot;

}/*** 前序遍历二叉树

*

*@paramroot*/

public voidpreOderTree(TreeNode root) {if (root == null)return;

System.out.println(root.val);

preOderTree(root.left);

preOderTree(root.right);return;

}/*** 中序遍历二叉树

*

*@paramroot*/

public voidinOderTree(TreeNode root) {if (root == null)return;

inOderTree(root.left);

System.out.println(root.val);

inOderTree(root.right);return;

}/*** 后序遍历二叉树

*

*@paramroot*/

public voidpostOderTree(TreeNode root) {if (root == null)return;

postOderTree(root.left);

postOderTree(root.right);

System.out.println(root.val);return;

}/*** 层次遍历二叉树

*

*@paramroot*/

public voidlevelOderTree(TreeNode root) {if (root == null)return;

Queue nodes = new LinkedList();

nodes.add(root);while (!nodes.isEmpty()) {

TreeNode node=nodes.poll();

System.out.println(node.val);if (node.left != null) {

nodes.add(node.left);

}if (node.right != null) {

nodes.add(node.right);

}

}

}/*** 给定一颗二叉搜索树，请找出其中的第k大的结点。例如， 5 / \ 3 7 /\ /\ 2 4 6 8 中， 按结点数值大小顺序第三个结点的值为4。

* 解法一：时间复杂度O(k),空间复杂度O(1)

*

*@paramroot

*@paramk

*@return

*/

int count = 0;//计数器

public TreeNode KthNodeRe(TreeNode root, intk) {if (root != null) {

TreeNode node=KthNodeRe(root.left, k);if (node != null)returnnode;

count++;if (count ==k)returnroot;

node=KthNodeRe(root.right, k);if (node != null)returnnode;

}return null;

}

ArrayList arr = new ArrayList();/*** 解法二：时间复杂度O(n),空间复杂度O(n)

*

*@parampRoot

*@paramk

*@return

*/

public TreeNode KthNode(TreeNode pRoot, intk) {if (pRoot == null || k <= 0)return null;

InOder(pRoot);return k > arr.size() ? null : arr.get(arr.size() -k);

}public voidInOder(TreeNode pRoot) {if (pRoot == null)return;

InOder(pRoot.left);

arr.add(pRoot);

InOder(pRoot.right);

}/*** 如何得到一个数据流中的中位数？如果从数据流中读出奇数个数值，

* 那么中位数就是所有数值排序之后位于中间的数值。如果从数据流中读出偶数个数值，

* 那么中位数就是所有数值排序之后中间两个数的平均值

*@paramnum*/

private PriorityQueue minHeap = new PriorityQueue<>();private PriorityQueue maxHeap = new PriorityQueue(new Comparator() {

@Overridepublic intcompare(Integer o1, Integer o2) {return o2 -o1;

}

});public voidInsert(Integer num) {if (count % 2 == 0) {//1.新加入的元素先入到大根堆，由大根堆筛选出堆中最大的元素

maxHeap.offer(num);int filteredMaxNum =maxHeap.poll();//2.筛选后的【大根堆中的最大元素】进入小根堆

minHeap.offer(filteredMaxNum);

}else{//1.新加入的元素先入到小根堆，由小根堆筛选出堆中最小的元素

minHeap.offer(num);int filteredMinNum =minHeap.poll();//2.筛选后的【小根堆中的最小元素】进入大根堆

maxHeap.offer(filteredMinNum);

}

count++;

}publicDouble GetMedian() {if (count % 2 == 0) {return new Double((minHeap.peek() + maxHeap.peek())) / 2;

}else{return newDouble(minHeap.peek());

}

}

@Testpublic voidtestDeserialize() {

String str= "1,2,4,#,#,5,#,#,3,#,#";

TreeNode root=Deserialize(str);

preOderTree(root);

}

@Testpublic voidtestBuildTreePre() {

String str= "1,2,4,#,#,5,#,#,3,#,#";

TreeNode root=Deserialize(str);//preOderTree(root);

String serialize =Serialize(root);

System.out.println(serialize);

}

@Testpublic voidtestBuildTreeLevel() {int[] a = { 1, 2, 3, 4, 5};

TreeNode root=buildTreeLevel(a);

inOderTree(root);

}

@Testpublic voidtestBuildTreeKthNode() {int[] a = { 4, 2, 5, 1, 3};

TreeNode root=buildTreeLevel(a);

inOderTree(root);

}

}