Largest Rectangle in Histogram

public class Solution {
         public int largestRectangleArea(int[] height) {
        int [] leftSmall = new int[height.length];
        int [] rightSmall = new int[height.length];
        Stack<PositionNode> smallStack = new Stack<PositionNode>();
        for (int i = 0; i < height.length; i++) {
            while (!smallStack.isEmpty() && smallStack.peek().height >= height[i]){
                smallStack.pop();
            }
            if (!smallStack.isEmpty()) 
            {
                leftSmall[i] = smallStack.peek().pos;
             }  else {
                leftSmall[i] = -1;
             }
            smallStack.push(new PositionNode(i,height[i]));
        }
            smallStack.clear();
          for (int i = height.length - 1; i > -1; i--) {
              while (!smallStack.isEmpty() && smallStack.peek().height >= height[i]){
                smallStack.pop();
            }
            if (!smallStack.isEmpty()) {
                rightSmall[i] = smallStack.peek().pos;
            }
             else {
                 rightSmall[i] = height.length ;
             }
            PositionNode newNode = new PositionNode(i,height[i]);
            smallStack.push(newNode);
        }
        int maxArea = 0;
        for (int i = 0; i < height.length; i++) {
            int thisArea = height[i] * Math.abs(rightSmall[i] - leftSmall[i] - 1);
            maxArea = Math.max(maxArea,thisArea);
        }
        return maxArea;
    }
    class PositionNode {
        int pos;
        int height;
        public PositionNode(int pos, int height) {
            this.pos = pos;
            this.height = height;
        }
    }
}