Binary Tree Data Structure

Learn more about Binary Tree in DSA Self Paced Course
Practice Problems on Binary Tree !
Top Quizzes on Binary Tree

Binary Tree is defined as a tree data structure where each node has at most 2 children. Since each element in a binary tree can have only 2 children, we typically name them the left and right child.

A Binary tree is represented by a pointer to the topmost node (commonly known as the “root”) of the tree. If the tree is empty, then the value of the root is NULL. Each node of a Binary Tree contains the following parts:

1. Data
2. Pointer to left child
3. Pointer to right child

• Inserting an element.
• Removing an element.
• Searching for an element.
• Traversing the tree.

• Finding the height of the tree
• Find the level of a node of the tree
• Finding the size of the entire tree.

Topic :

Introduction :

Basic Operations on Binary Tree:

Some other important Binary Tree Traversals :

Must solve Standard Problems on Binary Tree Data Structure:

Quick Links :

• ‘Practice Problems’ on Trees
• ‘Quizzes’ on Binary Trees
• ‘Videos’ on Trees

Recommended:

• Learn Data Structure and Algorithms | DSA Tutorial

If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to review-team@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks. Please write
comments if you find anything incorrect, or you want to share more information about the topic discussed above.