What is binary search tree? Explain with an example

28kviews

written 8.8 years ago by

teamques10 ★ 69k

modified 2.6 years ago by

sagarkolekar ★ 11k

data structures and algorithms

ADD COMMENT EDIT

1 Answer

3.1kviews

written 8.8 years ago by

teamques10 ★ 69k

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 4 others joined a min ago.

ADD COMMENT EDIT

Please log in to add an answer.