#### Java Data Structure Binary Tree : Print The Nth Level

Printing Nth Level in a binary tree is the same as doing level order traversal. Logic : We loop through all the levels. And, we maintain the current level count.…

Skip to content
#### Java Data Structure Binary Tree : Print The Nth Level

#### FUNCTIONAL PROGRAMMING : Currying In Java, How to curry a hashmap

#### Java Module System – How to create a module, compile it and run the modular java application from a command line.

#### Write java code to find that a given binary tree is a subtree of another binary tree

#### Java code to find diameter of a binary tree

#### Stack datastructure implementation in C programming Language.

#### AVL Tree Insertion Deletion Search in C Programming Language

Printing Nth Level in a binary tree is the same as doing level order traversal. Logic : We loop through all the levels. And, we maintain the current level count.…

Currying is just a name for a function, which does not have all the arguments passed to it. So, if have a function which takes 4 arguments, we will provide…

In this post, I am going to tell you how to create a module. How you can compile that module and use modular architecture to run java application. you can…

There are two binary tree and you have to find that , one of the binary tree is the sub-tree in another binary tree. We have three cases here. The…

Diameter of a binary tree is the maximum width at any node level. The maximum width can be at last level and that can be the diameter of a binary…

Stack is an abstract data-structure. This data-structure allows user to access the contents in Last In First Out order. This means, the latest element which was put in the data-structure,…

AVL Tree is a Balanced Binary Search Tree. What does balance means? It means that, we try to minimize the number of traversals, during search, insertion or deletion or any…