How to Implement a Binary Tree in Java | Binary Tree Data Structure

Watch all my playlist here:

Want to land a software engineering job in the IT industry? This course - 'Visualizing Data Structures and Algorithms' is here to help. The course walks you through multiple Java algorithms, data structures problems, and their solutions with step by step visualizations, so that you are actually learning instead of blindly memorizing solutions.

The course covers in and outs of Data Structures and Algorithms in Java. Java is used as the programming language in the course. Students familiar with Javascript, Python, C#, C++, C, etc will also get to learn concepts without any difficulty. The implementation of various Algorithms and Data Structures have been demonstrated and implemented through animated slides. It covers many interview room questions on Algorithms and Data Structures. The questions and solutions are demonstrated by -

1. Animated slide. (To make visualization of algorithms faster)
2. Coding algorithm on IDE.

The course covers topics such as -
0. Algorithm Analysis
1. Arrays
2. Matrix
3. Singly Linked List
4. Doubly Linked List
5. Circular Singly Linked List
6. Stacks
7. Queues
8. Binary Tree
9. Binary Search Tree
10. Graphs
11. Priority Queues and Heaps
12. Recursion
13. Searching
14. Sorting
15. Strings
16. Trie Data Structure
17. Dynamic Programming
and many more ...

#dsa #algorithms #coding

[itsdineshvaryani]

Hi All,
The hardcoding done in this video just demonstrates how Binary Tree stores the elements in form of left and right children. Please follow upcoming lectures to understand the dynamic way of doing this.

[shubhamagarwal]

Best series for DS & Algo. I am also 10 yrs java exp guy. Was looking for DS & Algo free course over YouTube with java implementation and found this. Hats Off To You Man..Excellent Work. GOD BLESS YOU :)

[randipmalakar]

Excellent ! I like the way you are introducing the idea....You made it very simple to understand the fundamental building blocks instead of making it complex (in other YouTube videos I found they start directly with recursive or queue data structure which is not easy to begin with)....Please don't change this video content as its very good for beginners to understand the basics. Thanks for your efforts and help.

[narsinghcharan]

Sir Ji, you are Awesome. The visual representation helping me a lot. Thank you very very much. please please create some more data structure videos.

[vishalsoni]

wonderful, I am searching this kind of video for understanding tree ds the way you are explaining is amazing.

[ati]

Thank you so much, this was my homework ;)

[vishalsoni]

Excellent, the way you are teaching is awesome.👌

[puna]

hi dinesh, you video sessions are awesomme.

[shubhamagarwal]

Your playlist is like energy drink, i need before my DSA interviews...helped me changeing job last year and i am sure will help me this year as well...thanks a lot bro for this wonderful playlist..👍👍

[TheGuidingLight]

sir please add insertion deletion operation dynamically(in methods) in tree in paid material.

[JuHan]

This is quite helpful. Thank you very much.

[satyampandey]

Sir what is different btwn tree implement and tree insertiin

[_rimanshurambhad]

when i run the code nothing happend, didnt saw any output why is this?

[nandinipriya]

sir is the default value in left and right of a node null here?

[infohub]

Hello Sir!
What we print after line 33 in public static void main class in this program?

[padakantisaichandra]

in java we don't have pointers. But u told node left and right as pointers .they are not not pointers so what they are called sir??

[phintojpious]

why you didn't show the output in ide..?

[javlontursunov]

Man, as I can see, u r not using the recursive method to create a binary tree. When you are creating a tree next time, try including the recursive method so that we don't have to write every node separately.

[mrmansir]

how do you put the code in the main function to run it? it won't let me do it because the createBinaryTree method is nonstatic, and I'm calling it in a static method (main)