108. Convert Sorted Array to Binary Search Tree

Given an array where elements are sorted in ascending order, convert it to a height balanced BST.
For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.
Example:
Given the sorted array: [-10,-3,0,5,9],

One possible answer is: [0,-3,9,-10,null,5], which represents the following height balanced BST:

---

题解：

package leetcode;

import java.util.*;

public class Solution {
    public static void main(String[] args) {
        int[] a = { -10, -3, 0, 5, 9 };
        Node root = convert(a);
        levelOrderTraversal(root);
        System.out.println();
    }

    public static Node convert(int[] a) {
        if (a == null || a.length == 0)
            return null;

        return convert(a, 0, a.length - 1);
    }

    public static Node convert(int[] a, int lo, int hi) {
        if (lo > hi)
            return null;

        int mid = (lo + hi) / 2;
        Node root = new Node(a[mid]);
        root.lchild = convert(a, lo, mid - 1);
        root.rchild = convert(a, mid + 1, hi);
        return root;
    }

    public static void levelOrderTraversal(Node root) {
        if (root == null)
            return;

        Queue<Node> queue = new LinkedList<Node>();
        queue.offer(root);
        while (!queue.isEmpty()) {
            Node curr = queue.poll();
            System.out.print(curr.value + " ");
            if (curr.lchild != null)
                queue.offer(curr.lchild);
            if (curr.rchild != null)
                queue.offer(curr.rchild);
        }
    }
}

class Node {
    Node(int value) {
        this.value = value;
        this.lchild = null;
        this.rchild = null;
    }

    public int value;
    public Node lchild;
    public Node rchild;
}