剑指offer题63

package jianzhioffer;

import java.util.ArrayList;
import java.util.Scanner;

import jianzhioffer.BinaryTree;

/**
 * 给定一颗二叉搜索树，请找出其中的第k大的结点。例如， 5 / \ 3 7 /\ /\ 2 4 6 8 中，按结点数值大小顺序第三个结点的值为4。
 *
 */
/* //树节点
public class TreeNode {
    int val = 0;
    TreeNode left = null;
    TreeNode right = null;

    public TreeNode(int val) {
        this.val = val;
    }
}*/

public class Solution63 {
	
//	中序遍历二叉排序树，找第k个元素即可
	/*static TreeNode KthNode(TreeNode pRoot, int k){
		if(k<=0||pRoot == null){
			return null;
		}
		ArrayList<TreeNode> list = new ArrayList<TreeNode>();
		TreeNode test = new TreeNode(-1);
		if(list.size() == 0){
			list.add(test);
		}
		Inorder(pRoot,list);
		if(k>list.size()-1){
			return null;
		}
		return list.get(k);
	}

	private static void Inorder(TreeNode pRoot, ArrayList<TreeNode> list) {
		if(pRoot == null)
			return;
		Inorder(pRoot.left,list);
		list.add(pRoot);
		Inorder(pRoot.right,list);
	}*/
	
//	中序递归实现
	static int count = 0;
	static TreeNode KthNode(TreeNode pRoot, int k){
		if(pRoot == null){
			return null; //递归截止条件
		}
		TreeNode node = KthNode(pRoot.left,k);
		if(node != null){
			return node;  //左子树中找到符合要求的节点返回
		}
		if(++count == k){
			return pRoot;  //从最左节点开始，count+1;
		}
		node = KthNode(pRoot.right,k);
		if(node != null){
			return node;   //左子树中没找到，在右子树找到了符合要求的节点返回
		}
		return null;
	}

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int k = sc.nextInt();
		
		TreeNode tree1 = new TreeNode(5);
		TreeNode tree2 = new TreeNode(3);
		TreeNode tree3 = new TreeNode(7);
		TreeNode tree4 = new TreeNode(2);
		TreeNode tree5 = new TreeNode(4);
		TreeNode tree6 = new TreeNode(6);
		TreeNode tree7 = new TreeNode(8);
		
		tree1.left = tree2;
	    tree1.right = tree3;
	    tree2.left = tree4;
	    tree2.right = tree5;
	    tree3.left = tree6;
	    tree3.right = tree7;
	    
	    System.out.println(KthNode(tree1,k).val);
	    

	}

}