Published on February 4, 2014 by mycodeschool

See complete series on data structures here:

In this lesson, we have implemented binary search tree in C/C++. We have written a simple program to create a binary search tree of integers and search an element in it.

See source code here:

Lesson on dynamic memory allocation:

For practice problems and more, visit: www.mycodeschool.com

Like us on Facebook: www.facebook.com/MyCodeSchool

Follow us on twitter: twitter.com/mycodeschool

Leave a Reply

264 Comments on "Binary search tree – Implementation in C/C++"

Notify of
avatar

Arup Naskar
Guest
Arup Naskar
4 days 19 hours ago

sir every time a new node becoming our root but what will happen at 16:45 if i want to enter 100 or any less value than 200. because our root still at 500.

A k
Guest
A k
20 days 19 hours ago

thnx alot

DHEERAJ SHARMA
Guest
DHEERAJ SHARMA
28 days 15 hours ago

Well explained. too good

Christopher Cerrachio
Guest
Christopher Cerrachio
1 month 19 days ago

thank you so much

Мохамед Исаак
Guest
Мохамед Исаак
2 months 5 days ago

make a full c leson

Henry Baltazar Torres Díaz
Guest
Henry Baltazar Torres Díaz
2 months 7 days ago

If I want to implement the code "else if" but using void instead of BstNode* (with the use of a pointer to a pointer). How will it be? I am trying to do this exercise but I didn't have success until now.

Usuf Arif
Guest
Usuf Arif
2 months 10 days ago

Excellent discussion on Data Structures, great detail and crisp content. Thanks. Yusuf Arif

Brian Faure
Guest
Brian Faure
2 months 13 days ago

For anyone interested in a Python version, check out my recent lesson:

Hons Barrera
Guest
Hons Barrera
2 months 14 days ago

I'm tired of this Udemy faggot with the purple shirt, he says every language is the shit

Hons Barrera
Guest
Hons Barrera
2 months 14 days ago

I'm tired of this Udemy faggot with the purple shirt, he says every language is the shit

1 2 3 22
wpDiscuz