Skip to content

BinaryTree traversals #36

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
Kratika28-agr wants to merge 3 commits into
base: master
Choose a base branch
from
Open

BinaryTree traversals #36

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
edaba0c
Create BinaryTreeImplementation
Kratika28-agr Oct 23, 2021
73ca65d
Create BinaryTree Implementation
Kratika28-agr Oct 23, 2021
b718286
Merge pull request #1 from Kratika28-agr/Kratika28-agr-patch-1
Kratika28-agr Oct 23, 2021
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
31 changes: 31 additions & 0 deletions src-java/BinaryTree Implementation
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,31 @@
public class BinaryTree{
private TreeNode root;
private class TreeNode{
private TreeNode left;
private TreeNode right;
private TreeNode null;

public TreeNode(int data){
this.data=data;
}
}

public void createBT(){
TreeNode first=new TreeNode(1);
TreeNode second=new TreeNode(2);
TreeNode third=new TreeNode(3);
TreeNode fourth=new TreeNode(4);
TreeNode fifth=new TreeNode(5);

root=first;
first.left=second;
first.right=third;
second.left=fourth;
second.right=fifth;
}

public static void main(String args[]){
BinaryTree bt=new BinaryTree();
bt.createBT();
}
}
31 changes: 31 additions & 0 deletions src-java/BinaryTreeImplementation
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,31 @@
public class BinaryTree{
private TreeNode root;
private class TreeNode{
private TreeNode left;
private TreeNode right;
private TreeNode null;

public TreeNode(int data){
this.data=data;
}
}

public void createBT(){
TreeNode first=new TreeNode(1);
TreeNode second=new TreeNode(2);
TreeNode third=new TreeNode(3);
TreeNode fourth=new TreeNode(4);
TreeNode fifth=new TreeNode(5);

root=first;
first.left=second;
first.right=third;
second.left=fourth;
second.right=fifth;
}

public static void main(String args[]){
BinaryTree bt=new BinaryTree();
bt.createBT();
}
}