Never cease to pursue knowledge
Never cease to pursue knowledge
Start learning today with our wide range of courses taught by industry experts. Gain new skills, advance your career, or explore new interests.
Browse CoursesCreate a student class with attributes name, roll number and marks. create 2 student objects and display their details class Student { String name; int rollNo; int marks; void display() { System.out.println(“Name=” +name); System.out.println(“Roll no=” +rollNo); System.out.println(“Marks=” +marks); } } class Main { public static void main(String args[]) { Student s1=new Student(); […]
Java Code: Find Maximum Element in Binary Tree // Node class definition class Node { int data; Node left, right; public Node(int item) { data = item; left = right = null; } } public class BinaryTreeMax { // Function to find the maximum element in the binary tree int findMax(Node node) […]
=== Student Management Menu === 1. Add Student 2. Display All Students 3. Search Student by Roll No 4. Remove Student 5. Exit Enter your choice: 1 Enter Roll No: 101 Enter Name: aaa Student added successfully! === Student Management Menu === 1. Add Student 2. Display All Students 3. Search Student by Roll […]
BFS(Breadth First search) –>also called as level order traversal(where you can visit nodes level by level from top to bottom and left to right
/Write a program to count the number of nodes in a tree
//reverse a elements of queue by using stack import java.util.*; class ReverseQueue { public static void main(String args[]) { Queue<Integer> q=new LinkedList<>(); q.add(1); q.add(2); q.add(3); Stack<Integer> s=new Stack<>(); while(!q.isEmpty()) { s.push(q.remove()); } while(!s.isEmpty()) { q.add(s.pop()); } System.out.println(“Reverse queue=” +q); } } output: Reverse queue=[3, 2, 1]
import java.io.*; import java.util.*; class Node { int data; Node next; Node(int d)//50 { data=d;//data=50 next=null; } } class LinkedList { public static void main(String args[]) { Node head=null; Scanner s=new Scanner(System.in); Node current=null; for(int i=1;i<=5;i++)i=5<=5 { System.out.println(“Enter the elements=”);//50 int a=s.nextInt();//a=50 Node n=new Node(a);//create a node inside […]
Learn the fundamentals of programming with Python in this beginner-friendly course.
Master the basics of data analysis, visualization, and machine learning.
Build modern websites with HTML, CSS, JavaScript and popular frameworks.
Learn SEO, social media marketing, email campaigns and analytics.