六月二十七的博客

//求二叉树的最大深度public class Node{ public int value; public Node left; public Node right; public Node(int data){ this.value=data; } }//递归实现int maxDeath(Node root){ if(r...

//二叉树先遍历public class Node{ public int value; public Node left; public Node right; public Node(int data){ this.value=data; }}//递归实现二叉树先序遍历public void preOrderRecur(Nod...

//二叉树中序遍历public class Node{ public int value; public Node left; public Node right; public Node(int data){ this.value=data; }}//递归实现二叉树中序遍历public void inOrderRecur(Nod...

//二叉树后序遍历public class Node{ public int value; public Node left; public Node right; public Node(int data){ this.value=data; }}//递归实现二叉树后序遍历public void posOrderRecur(No...

//在二叉树中找到累加和为指定值的最长路径长度public class Node{ public int value; public Node left; public Node right; public Node(int data){ this.value=data; }}public int getMaxlength(Nod...

//找到二叉树中的最大搜索二叉子树public class Node{ public int value; public Node left; public Node right; public Node(int data){ this.value=data; }}public Node biggestSubBST(Node hea...

//层序遍历二叉树public class Node{ public int value; public Node left; public Node right; public Node(int data){ this.value=data; } }//利用队列public void layerTranverse(){ ...