package edu.java.chap4;

/*
 * write an algorithm to find the 'next' node (i.e., in-order successor) of a given node in a 
 * binary search tree. You may assume that each node has a link to its parent.
 */
public class NextNode {

	public static TreeNode inorder(TreeNode n){
		if (n == null) return null;
		
		//if(n.parent == null || n.right != null)
		return null;
	}
	
	public static void main(String[] args) {
		

	}

}