BST的有序性

给定一棵二叉搜索树, 请找出其中的第k小的结点.
思路: 按照中序遍历找.

class TreeNode1 {
    int val = 0;
    TreeNode1 left = null;
    TreeNode1 right = null;

    public TreeNode1(int val) {
        this.val = val;
    }
}

public class DemoB {
    TreeNode1 KthNode(TreeNode1 pRoot, int k) {
        if (pRoot == null || k <= 0) {
            return null;
        }
        Stack<TreeNode1> st = new Stack<>();
        TreeNode1 node1 = pRoot;
        do {
            while (node1 != null) {
                st.push(node1);
                node1 = node1.left;
            }
            if (!st.empty()) {
                node1 = st.pop();
                k--;
                if (k == 0) {
                    return node1;
                }
                node1 = node1.right;
            }
        } while (node1 != null || !st.empty());
        //do while()循环.
        return null;
    }
}