answersLogoWhite

0

no they are not same

User Avatar

Wiki User

13y ago

What else can I help you with?

Related Questions

How can you merge two binary search trees into a single binary search tree?

To merge two binary search trees into a single binary search tree, you can perform an in-order traversal on each tree to extract their elements, combine the elements into a single sorted list, and then construct a new binary search tree from the sorted list. This process ensures that the resulting tree maintains the binary search tree property.


What is complexity of binary search tree?

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).


How do you print all data in a Binary Search Tree?

By using Depth First Search or Breadth First search Tree traversal algorithm we can print data in Binary search tree.


Are binary tree and binary tree same?

Yes.


What is the different between a binary search tree and a binary tree?

self depend friend"s............


Is an AVL tree a binary search tree (BST)?

Yes, an AVL tree is a type of binary search tree (BST) that is balanced to ensure efficient searching and insertion operations.


Is sorting a binary search tree simple?

A binary search tree is already ordered. An in order traversal will give you a sorted list of nodes.


What is the time complexity of searching a binary search tree?

The time complexity of searching a binary search tree is O(log n), where n is the number of nodes in the tree.


What is the use of binary?

Binary trees are commonly used to implement binary search tree and binary heaps.


When converting binary tree into extended binary tree all the original nodes in binary tree are?

will remain same


What is the height of a binary search tree?

The height of a binary search tree is the maximum number of edges from the root node to a leaf node. It represents the longest path from the root to a leaf in the tree.


What is the time complexity for finding an element in a binary search tree?

The time complexity for finding an element in a binary search tree is O(log n), where n is the number of nodes in the tree.