0
27kviews
What is binary search tree? Explain with an example
1 Answer
1
3.1kviews
  • A binary tree is a non-linear data structure which is a collection of elements called nodes.
  • In a binary tree, the topmost element is called the root-node. An element can have 0,1 at the most 2 child nodes.
  • There are many variants of Binary tree. A Binary search tree or …

Create a free account to keep reading this post.

and 2 others joined a min ago.

Please log in to add an answer.