Author: Arpit Mandliya
- 16 April
Delete a node from binary search tree in java
If you want to practice data structure and algorithm programs, you can go through 100+ java coding interview questions. In this post, we will see how to delete a node from binary search tree. There are two parts to it. Search the node After searching that node, delete the node. There are three cases which we […]
- 15 April
Spring Restful web services CRUD example
In this post, we are going see Spring Restful web services CRUD example. Web service Tutorial Content: Introduction to web services Web services interview questions SOAP web service introduction RESTful web service introduction Difference between SOAP and REST web services SOAP web service example in java using eclipse JAX-WS web service eclipse tutorial JAX-WS web service […]
- 15 April
Binary search tree in java
If you want to practice data structure and algorithm programs, you can go through 100+ java coding interview questions. Binary search tree is a special type of binary tree which have following properties. Nodes which are smaller than root will be in left subtree. Nodes which are greater than root will be right subtree. It should […]
- 15 April
Find minimum and maximum elements in binary search tree in java
If you want to practice data structure and algorithm programs, you can go through 100+ java coding interview questions. In this post, we will see how to find minimum and maximum elements in binary search tree. Finding minimum element: Minimum element is nothing but leftmost node in binary search tree, so traverse left until you get […]
- 14 April
jQuery Selector examples
jQuery selectors are important part of jQuery. It is used to select DOM elements and manipulate it. Syntax: It should start with $ followed by parenthesis. For below html, you want to hide text on click of button. So you need to select button with id “myButton” as $(“#myButton”) and div with id helloWorldDiv as […]
- 14 April
Lowest Common Ancestor (LCA) of binary search tree in java
If you want to practice data structure and algorithm programs, you can go through 100+ java coding interview questions. In this post, we will see how to find lowest common ancestor(LCA) of two nodes in binary search tree. We have already seen how to find LCA in binary tree. It is much simple than that. Lets […]
- 14 April
Lowest Common Ancestor (LCA) of binary tree in java
If you want to practice data structure and algorithm programs, you can go through 100+ java coding interview questions. In this post, we will see how to find lowest common ancestor(LCA) of two nodes in binary tree. Lets understand with example. As you can see here, LCA is nothing but lowest common parent of two nodes. […]
- 13 April
Boundary traversal of binary tree in java
If you want to practice data structure and algorithm programs, you can go through 100+ java coding interview questions. In this post, we will see boundary traversal of binary tree in java. Lets understand boundary traversal of binary tree with example: If you look closely to above diagram, boundary traversals can be divided into three essential […]
- 12 April
Java Collections interview questions and answers
In this post, I am going to share some of logical java Collections interview questions which will help to understand Collections concepts better. For an extensive list of java programs, please go to Java interview programs. Question 1: What can be output of below code : [crayon-678217f2a4de9269452358/] options are :Â A)France France India B)India India […]