Print binary tree in reverse order – level order traversal (BFS/ java/example)
Given binary tree in java, print binary tree in reverse order using level order traversal or breadth first search (BFS) non recursive algorithm (example).
Print ancestors of node in a binary tree (java/ recursive/ examples)
We are given the binary tree. We have to print all the ancestors particular node of binary tree. Let us take an example to understand the problem statement.
Print paths from root to leaf nodes in binary tree (Java/ recursive)
We have to print all the paths from root to leaf node. Let us take quick example to elaborate the problem statement. Suppose we are given the following binary tree.
Convert binary tree to mirror/symmetric tree in java (recursive /example)
What is binary tree?
A tree data structure in which a node can at maximum two children. Binary Tree can have have one child or two children. Node in binary Tree can have following structure
Node having one child
Left child
Right child
Node having two children
Both Left and right child
Find number of nodes/size of binary tree in java (BFS / example)
We have to find the number of nodes in the binary tree. We will use the Level order traversal or Breadth first traversal to scan the complete binary tree. We have to travel at-least once to get the number of nodes in the binary tree.
Count non-leaf nodes (left & right child) in binary tree (java/ non-recursive/example)
A node in a binary tree which has child node(s) is called non leaf node.
Non Leaf Node can be categorized as follows:
Non Leaf node having one child (Either left child or right child)
Non Leaf node having two children (Both left child and right child)
Count non leaf nodes in binary tree having one child node (BFS/example)
Find number of non leaf nodes in binary tree with one child node breadth first search(BFS)/level order traversal(non-recursive) algorithm (example)
Count non leaf nodes in binary tree in java (BFS /examples)
What is non leaf node in binary tree?
A node in a binary tree which has child node(s) is called non leaf node.
Non Leaf Node can be Node having one child or both children:
One child (Either left child or right child)
Two children (Both left child and right child)
Find number of leaf nodes in a binary tree (Java/ BFS /example)
What is leaf node in binary tree?
A node in a binary tree which do not have any child nodes is called leaf node. The leaf node do not have any children i.e. left and right reference both null. We have to count the number of leaf nodes in the binary tree. In other ways we need to find out all the nodes in the binary tree which do not have any children (both right node and left node null).
So as per our problem statement, we have to iterate over the binary tree and find the number of leaf nodes in the binary tree.
Find maximum/ largest element in a binary tree ( java/ BFS / example)
We are given the Binary Tree, we need to find the maximum element in the Binary Tree. Suppose we have following tree, As per the problem statement we have to iterate over the binary tree and find the maximum element in the binary tree.
LCA (Lowest common ancestor) – binary tree (recursive / example)
Lowest or least common ancestor is the earliest possible node where concerned child nodes joined.
Let us take an example tree, we will discuss some examples to clarify the LCA.
Create/Implement thread/ task using runnable interface & thread class (java/ example)
We have already discussed about the basics of Threads in java. Now we will discuss about creation process in java.
How we can create threads in java
Extending a class
Implementing a interface:
Find level in binary tree having maximum sum (java/ non-recursive/ example)
What is level in binary tree?
As per the definition of binary tree is one, where each node has, at most, 2 children. Each node can have left and right child. The root of the tree, is at level 0. Root’s children are at level 1, etc.
As an example, consider the tree:
Find sum of nodes in binary tree ( java/ non-recursive/ example)
We have to calculate the sum of all the nodes in a binary tree. To get the sum of all nodes in binary tree, we need to traverse the whole binary tree and while traversing we can start adding the sum of each node.
Find height of binary tree in java using BFS/level order traversal (example)
Let us define the problem statement, before we start our discussion about calculating the height of binary tree. What is height of Binary tree? Conventionally, the longest path from root to deepest leaf node define the height of binary tree.
Binary tree traversal – level order/breadth first search (java/example)
Binary tree traversal using level order traversal or breadth first search non recursive algorithm in java (example). Visit root to leaf node level wise.
Recursive binary tree traversal algorithm in java (preOrder /postOrder/inOrder)
Binary Tree traversal is broadly categorized into following category
1.) Depth First Traversal
Pre Order Traversal
Post Order Traversal
In Order Traversal
2) Breadth First Traversal or Level Order Traversal.
Delete all nodes of a binary tree in java (recursive/ DFS/ example)
To delete binary tree, we have to delete all the nodes in the tree. We have discussed about deleting the node in binary search tree in separate post. Before we discuss about deleting tree, we will start from very small tree, then we will use this foundation to delete the whole tree. Suppose we have tree of 3 nodes
What is serialization & deserialization process in java (example)
1. Background of Serialization & Deserialization process: Before we start our discussion about the Serialization and Deserialization, We will discuss
What is difference between REST & SOAP web services.
REST vs SOAP
REST and SOAP are different concepts altogether, We have summarized the few basic differences of REST and SOAP.
Custom Logging Filter – Jersey ContainerRequestFilter & ContainerResponseFilter
RESTFul web service logging filter implementation example using jersey framework container request / response filters (log header, REST information etc.)
Create first RESTFul Web Service using Jersey framework (CRUD operations)
REST Service : REST is acronym used for Representational State Transfer. REST is architectural style which is mostly used to build web services. In the REST paradigm we are always thinking about the resources similarly what like in OOPS we are thinking about the objects.
Create single thread pool using executor in java (with example)
Thread Pool : Thread pool is collection of threads which are created to complete certain tasks.
The interaction between thread pool and task is as follows
1.) Thread Pool is created
2.) Task are created.
3.) Task assigned to Thread in thread pool.
Create fixed thread pool in java using Executors (example)
Thread Pool : Thread pool is collection of threads which are created to complete certain tasks.
The interaction between thread pool and task is as follows
1.) Thread Pool is created
2.) Task are created.
3.) Task assigned to Thread in thread pool.
What is thread in java with example (Real world analogy) ?
Everybody in this world is performing one duty or the other.The duties we are performs is like the functional activity of bigger execution block. Let us shrink our vision and take one house to understand. In traditional family environment husband involves in earning to maintain day to day expenses and wife involves in house hold activitie
What is client server architecture with example (real world analogy) ?
The person or device that is capable of serving is called the Server. In our day to day life we come across various servers. We generally purchase vegetable or fruits from a vendor (Shopkeeper / hawker). We request the shopkeeper for required vegetables/fruits. The shop keeper provides us the required vegetable or fruits. We ask the shopkeeper and he provides us the food items. So, Shopkeeper is at our service, which fulfills our need.