depth of a binary tree ?

[kri shan]

Arrays.binarySearch(int[], key) gives Searches the specified array of the specified value using the binary search algorithm. How to find the depth of a binary tree based on key or value of any node.

[Henry Wong]

kri shan wrote:Arrays.binarySearch(int[], key) gives Searches the specified array of the specified value using the binary search algorithm. How to find the depth of a binary tree based on key or value of any node.

The Arrays.binarySearch() method searches arrays -- there isn't any binary tree, and hence, no "depth" to speak of. Now, if you meant, how many iterations before the element is found, I don't think you can get that data. It just returns where it is found, and where between, if not found.

Henry

[kri shan]

depthBinarySearch(root node, Element )
Element is left node / right node element needs depth of the binary search tree.
Start from the root node, compare each right node / left node and add counter increment until find the element. Is it right approach ?

[kri shan]

I am planning to use LinkedList. Is it right approach ?

[Seetharaman Venkatasamy]

kri shan wrote:
Start from the root node, compare each right node / left node and add counter increment until find the element. Is it right approach ?

Correct! .

kri shan wrote:
I am planning to use LinkedList. Is it right approach ?

you are on right path. LinkedList data structure is the basic to implement Tree.