Binary Search Tree from a string of numbers?

[pankajit09]

Hello,

I have a textbox in which I have to enter a string of numbers.

The numbers are to be converted in to a Binary Search Tree and then I have to determine whether the BST is a -->

1. Complete Binary Tree or
2. Almost complete Binary Tree or
3. Binary Tree

[ronverdonk]

Show your code developed so far!

Ronald :cool:

[pankajit09]

Show your code developed so far!

Ronald :cool:

I am implementing that using a simple ARRAY.

The position of the numbers in the array is determined by -->
2N + 1 (left) and 2N + 2 (right)


After implementing the BST I have to determine whether its a complete BT or ACBT or BT .