- Convert sorted array to BST
- Print the above tree level by level
- I forgot the last question

Question

- Convert sorted array to BST
- Print the above tree level by level
- I forgot the last question

thy · Accepted Answer

BinaryTree* sortedArrayToBST(int arr[], int start, int end) {
  if (start > end) return NULL;
  // same as (start+end)/2, avoids overflow.
  int mid = start + (end - start) / 2;
  BinaryTree *node = new BinaryTree(arr[mid]);
  node->left = sortedArrayToBST(arr, start, mid-1);
  node->right = sortedArrayToBST(arr, mid+1, end);
  return node;
}
 
BinaryTree* sortedArrayToBST(int arr[], int n) {
  return sortedArrayToBST(arr, 0, n-1);
}

bj · Answer

static void printBSTLevelByLevel(BSTNode root){
        Queue q = new LinkedList();
        q.add(root);
        BSTNode tmp;
        while(q.size() > 0){
            tmp = q.remove();
            System.out.println(tmp);
            if (tmp.getLeft() != null){
                q.add(tmp.getLeft());
            }
            if (tmp.getRight() != null){
                q.add(tmp.getRight());
            }
        }
    }

Meta

Meta Interview Question

Interview Answers

Want the inside scoop on your own company?

Bowls

Followed companies

Job searches