Binary Tree Data Structure Code Implementations
Production-ready Binary Tree Data Structure data structure implementations in C++, Python, Java, and JavaScript on AntInLoop.
Study Binary Tree Data Structure Guide ยท Launch Visualizer
CPP Implementation
#include <iostream>
using namespace std;
// Node structure for the binary tree
struct Node {
int data;
Node* left;
Node* right;
Node(int val) {
data = val;
left = right = nullptr;
}
};
// Binary Tree class
class BinaryTree {
private:
Node* root;
// Helper recursive function for insertion
Node* insert(Node* node, int val) {
if (node == nullptr) {
return new Node(val);
}
if (val < node->data) {
node->left = insert(node->left, val);
} else {
node->right = insert(node->right, val);
}
return node;
}
// Helper recursive function for searching
bool search(Node* node, int val) {
if (node == nullptr) return false;
if (node->data == val) return true;
if (val < node->data)
return search(node->left, val);
else
return search(node->right, val);
}
// Traversals
void inorder(Node* node) {
if (node == nullptr) return;
inorder(node->left);
cout << node->data << " ";
inorder(node->right);
}
void preorder(Node* node) {
if (node == nullptr) return;
cout << node->data << " ";
preorder(node->left);
preorder(node->right);
}
void postorder(Node* node) {
if (node == nullptr) return;
postorder(node->left);
postorder(node->right);
cout << node->data << " ";
}
public:
BinaryTree() {
root = nullptr;
}
void insert(int val) {
root = insert(root, val);
}
bool search(int val) {
return search(root, val);
}
void inorder() {
inorder(root);
cout << endl;
}
void preorder() {
preorder(root);
cout << endl;
}
void postorder() {
postorder(root);
cout << endl;
}
};
// Driver code
int main() {
BinaryTree tree;
tree.insert(50);
tree.insert(30);
tree.insert(70);
tree.insert(20);
tree.insert(40);
tree.insert(60);
tree.insert(80);
cout << "Inorder Traversal: ";
tree.inorder();
cout << "Preorder Traversal: ";
tree.preorder();
cout << "Postorder Traversal: ";
tree.postorder();
cout << "Search 40: " << (tree.search(40) ? "Found" : "Not Found") << endl;
cout << "Search 25: " << (tree.search(25) ? "Found" : "Not Found") << endl;
return 0;
}
JAVA Implementation
// Binary Tree Implementation in Java
class BinaryTree {
// Node structure
static class Node {
int data;
Node left, right;
Node(int val) {
data = val;
left = right = null;
}
}
Node root;
BinaryTree() {
root = null;
}
// Insert a node
Node insert(Node node, int val) {
if (node == null) {
return new Node(val);
}
if (val < node.data) {
node.left = insert(node.left, val);
} else {
node.right = insert(node.right, val);
}
return node;
}
void insert(int val) {
root = insert(root, val);
}
// Search for a value
boolean search(Node node, int v