构造数组的MaxTree

import java.util.HashMap;
import java.util.Stack;

/**
 * Created by lxw, liwei4939@126.com on 2017/10/26.
 */
public class MaxTree {

    public class Node{
        public int value;
        public Node left;
        public Node right;

        public Node(int data){
            this.value = data;
        }
    }

    public Node getMaxTree(int[] arr){
        Node[] nArr = new Node[arr.length];
        for(int i=0; i<arr.length; i++)
            nArr[i] = new Node(arr[i]);
        Stack<Node> stack = new Stack<Node>();
        HashMap<Node, Node> lBigMap = new HashMap<Node,Node>();
        HashMap<Node, Node> rBigMap = new HashMap<Node,Node>();
        for(int i=0; i<nArr.length; i++){
            Node curNode = nArr[i];
            while ((!stack.isEmpty()) && stack.peek().value < curNode.value)
                popStackSetMap(stack, lBigMap);
            stack.push(curNode);
        }
        while (!stack.isEmpty())
            popStackSetMap(stack, lBigMap);
        for(int i=nArr.length-1; i >= 0; i--){
            Node curNode = nArr[i];
            while ((!stack.isEmpty()) && stack.peek().value < curNode.value)
                popStackSetMap(stack,rBigMap);
            stack.push(curNode);
        }
        while (!stack.isEmpty())
            popStackSetMap(stack, rBigMap);

        Node head = null;
        for(int i=0; i< nArr.length; i++){
            Node curNode = nArr[i];
            Node left = lBigMap.get(curNode);
            Node right = rBigMap.get(curNode);
            if(left == null && right == null)
                head = curNode;
            else if(left == null){
                if(right.left == null)
                    right.left = curNode;
                else 
                    right.right = curNode;
            }else if(right == null){
                if(left.left == null)
                    left.left = curNode;
                else 
                    left.right = curNode;
            }else {
                Node parent = left.value < right.value?left:right;
                if(parent.left == null)
                    parent.left = curNode;
                else 
                    parent.right = curNode;
            }
            return head;
        }
    }

    public void popStackSetMap(Stack<Node> stack, HashMap<Node, Node> map){
        Node popNode = stack.pop();
        if(stack.isEmpty())
            map.put(popNode, null);
        else
            map.put(popNode, stack.peek());
    }
}