## Find sum of nodes in binary tree ( java/ non-recursive/ example)

## Find height of binary tree in java using BFS/level order traversal (example)

## Binary tree traversal using level order/breadth first search (java/example)

## Recursive binary tree traversal algorithm in java (preOrder /postOrder/inOrder)

## 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 one small concept, which we have studied in our academics. We know that all the high level languages (Java, C++, C etc) translated to low level or machine level language (i.e. Binary Code of 0… Read More »