no they are not same
The complexity of binary search tree : Search , Insertion and Deletion is O(h) . and the Height can be of O(n) ( if the tree is a skew tree). For Balanced Binary Trees , the Order is O(log n).
By using Depth First Search or Breadth First search Tree traversal algorithm we can print data in Binary search tree.
Yes.
self depend friend"s............
A binary search tree is already ordered. An in order traversal will give you a sorted list of nodes.
Binary trees are commonly used to implement binary search tree and binary heaps.
will remain same
a tree which has atmost two nodes is called binary tree binary search tree is a binary tree which satisfies the following 1.every node in tree must be distinct 2.values in right subtree > value at root 3.values in left subtree < value at root 4.left,right subtrees must be binary search trees
A strictly binary tree is one where every node other than the leaves has exactly 2 child nodes. Such trees are also known as 2-trees or full binary trees. An extended binary tree is a tree that has been transformed into a full binary tree. This transformation is achieved by inserting special "external" nodes such that every "internal" node has exactly two children.
Well, you might if you want to.
In the worst case a binary search tree is linear and has a height equal to the number of nodes. so h=O(h).
Yes because there is no real practical use for a binary tree other than something to teach in computer science classes. A binary tree is not used in the real world, a "B tree" is.