Java Program to Create the Prufer Code for a Tree

This is a java program to create Prufer code for a tree. In combinatorial mathematics, the Prüfer sequence (also Prüfer code or Prüfer numbers) of a labeled tree is a unique sequence associated with the tree. The sequence for a tree on n vertices has length n – 2, and can be generated by a … Read more

advertisement

Java Program to Find Location of a Point Placed in Three Dimensions Using K-D Trees

This is a Java Program to implement 3D KD Tree and Search an element. In computer science, a k-d tree (short for k-dimensional tree) is a space-partitioning data structure for organizing points in a k-dimensional space. k-d trees are a useful data structure for several applications, such as searches involving a multidimensional search key (e.g. … Read more

advertisement

Java Program to Perform Searching in a 2-Dimensional K-D Tree

This is a Java Program to implement 2D KD Tree and Search an element. In computer science, a k-d tree (short for k-dimensional tree) is a space-partitioning data structure for organizing points in a k-dimensional space. k-d trees are a useful data structure for several applications, such as searches involving a multidimensional search key (e.g. … Read more

advertisement

Java Program to Perform Partial Key Search in a K-D Tree

This is a Java Program to implement 2D KD Tree and perform partial search(Searching a node with either of the coordinate). In computer science, a k-d tree (short for k-dimensional tree) is a space-partitioning data structure for organizing points in a k-dimensional space. k-d trees are a useful data structure for several applications, such as … Read more

advertisement

Java Program to Construct K-D Tree for 2 Dimensional Data

This is a Java Program to implement 2D KD Tree and print the various traversals. In computer science, a k-d tree (short for k-dimensional tree) is a space-partitioning data structure for organizing points in a k-dimensional space. k-d trees are a useful data structure for several applications, such as searches involving a multidimensional search key … Read more

advertisement

Java Program to Perform Insertion in a 2 Dimensional K-D Tree

This is a Java Program to implement 2D KD Tree and insert the input set and print the various traversals. In computer science, a k-d tree (short for k-dimensional tree) is a space-partitioning data structure for organizing points in a k-dimensional space. k-d trees are a useful data structure for several applications, such as searches … Read more

advertisement

Java Program to Perform AVL Tree Operations

This is a Java Program to implement Self Balancing Binary Search Tree. A self-balancing (or height-balanced) binary search tree is any node-based binary search tree that automatically keeps its height (maximal number of levels below the root) small in the face of arbitrary item insertions and deletions. These structures provide efficient implementations for mutable ordered … Read more

advertisement

Preorder Traversal of a Binary Tree using Recursion in Java

This is a java program to construct a binary tree and perform preorder traversal of the constructed binary tree. Nodes visited are in the order: visit Root node visit Left node visit Right node Here is the source code of the Java Program to Perform Preorder Recursive Traversal of a Given Binary Tree. The Java … Read more

advertisement

Postorder Traversal of a Binary Tree using Recursion in Java

This is a java program to construct a binary tree and perform postorder traversal of the constructed binary tree. Nodes visited are in the order: visit Left node visit Right node visit Root node Here is the source code of the Java Program to Perform Postorder Recursive Traversal of a Given Binary Tree. The Java … Read more

advertisement

Inorder Traversal of a Binary Tree using Recursion in Java

This is a java program to construct a binary tree and perform inorder traversal of the constructed binary tree. Nodes visited are in the order: visit Left node visit Root node visit Right node Here is the source code of the Java Program to Perform Inorder Recursive Traversal of a Given Binary Tree. The Java … Read more

advertisement
Subscribe to our Newsletters (Subject-wise). Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with latest contests, videos, internships and jobs!

Youtube | Telegram | LinkedIn | Instagram | Facebook | Twitter | Pinterest
Manish Bhojasia - Founder & CTO at Sanfoundry
Manish Bhojasia, a technology veteran with 20+ years @ Cisco & Wipro, is Founder and CTO at Sanfoundry. He lives in Bangalore, and focuses on development of Linux Kernel, SAN Technologies, Advanced C, Data Structures & Alogrithms. Stay connected with him at LinkedIn.

Subscribe to his free Masterclasses at Youtube & technical discussions at Telegram SanfoundryClasses.