1. 问题描述:
输出先序遍历二叉树的第k个节点
2. 思路分析:
因为先序遍历是按照先访问根节点,假如有左孩子的话访问左孩子,有有孩子的话访问右孩子,,所以我们可以在一进入递归方法里面就对访问的节点进行计数,计数之后判断是否等于k,假如等于了那么输出结果然后return就好了,假如改为中序遍历或者是后序遍历那么也是一样的,只需要将将count计数变量和判断的代码移动到相应的位置即可
3. 具体的代码如下:
import java.util.Scanner;
public class Main {
/*
* 3
* 9 20
* 1 6 15 7
* 45 67 4
* */
static int count = 0;
static int k;
public static void main(String[] args) {
TreeNode<Integer> root = new TreeNode<Integer>(3);
TreeNode<Integer> l = new TreeNode<Integer>(9);
TreeNode<Integer> r = new TreeNode<Integer>(20);
TreeNode<Integer> ll = new TreeNode<Integer>(1);
TreeNode<Integer> lr = new TreeNode<Integer>(6);
TreeNode<Integer> rl = new TreeNode<Integer>(15);
TreeNode<Integer> rr = new TreeNode<Integer>(7);
TreeNode<Integer> lll = new TreeNode<Integer>(45);
TreeNode<Integer> llr = new TreeNode<Integer>(67);
TreeNode<Integer> rll = new TreeNode<Integer>(4);
root.left = l;
root.right = r;
l.left = ll;
l.right = lr;
r.left = rl;
r.right = rr;
rl.left = rll;
ll.left = lll;
ll.right = llr;
Scanner sc = new Scanner(System.in);
k = sc.nextInt();
find(root);
sc.close();
}
private static void find(TreeNode<Integer> node) {
if(node == null) return;
count++;
if(count == k){
System.out.println(node.value);
return;
}
find(node.left);
find(node.right);
}
public static class TreeNode<T>{
TreeNode<T> left;
TreeNode<T> right;
T value;
public TreeNode(T value) {
super();
this.value = value;
}
}
}