Java二叉树下一个节点

代码部分

package tree;


public class TreelinkNode {
	int val;
	TreelinkNode left = null;
	TreelinkNode right = null;
	TreelinkNode next = null;

	TreelinkNode(int val) {
		this.val = val;
	}

	@Override
	public String toString() {
		return "TreelinkNode{" +
				"val=" + val +
				", left=" + left +
				", right=" + right +
				", next=" + next +
				'}';
	}
}

package tree;


public class Solution {
	
	public TreelinkNode GetNext(TreelinkNode pNode) {
		if (pNode == null) {
			return null;
		}
		if (pNode.right == null) {
			for (; pNode.next != null && pNode.next.right == pNode; pNode = pNode.next) {
				//null
			};
			return pNode.next;
		}
		for (pNode = pNode.right; pNode.left != null; pNode = pNode.left) {
			//null
		};
		return pNode;
	}

	public static void main(String[] args) {
		TreelinkNode pNode = new TreelinkNode(1);
		Solution solution = new Solution();
		TreelinkNode treelinkNode = solution.GetNext(pNode);
		System.out.println(treelinkNode);
	}

}