top of page
This site was designed with the
.com
website builder. Create your website today.
Start Now
Re-search and Paper
My Profile
About Me
Contact
Blog
More
Use tab to navigate through the menu items.
Abhinav's Blog
Ex-Samsung, IndiGo, Google Interviewed
Android, Kotlin, Ktor, Python, Core-Java, Data-Structures, Algorithms, Design-Patterns, Interview Questions
All Posts
Python
spring boot
Search
Log in / Sign up
Abhinaw Tripathi
Jun 14, 2016
2 min read
Tree continue complete example in core-java
Complete Tree program: import java.util.Stack; /** * */ /** * @author Abhinaw.Tripathi * */ class Node { public int iData; ...
Abhinaw Tripathi
Jun 2, 2016
2 min read
Binary Tree to Binary Search Tree Conversion
Following is a 3 step solution for converting Binary tree to Binary Search Tree. 1) Create a temp array arr[] that stores inorder...
Abhinaw Tripathi
Jun 2, 2016
1 min read
Find k-th smallest element in BST (Order Statistics in BST)
Solution Approach: By using In order traversal of BST retrieves elements of tree in the sorted order. The in order traversal uses stack...
Abhinaw Tripathi
Jun 2, 2016
1 min read
How to check if a Binary Tree is BST or not?
What is Binary Search Tree(BST)? A binary search tree (BST) is a node based binary tree data structure. Must have these Properties: ...
bottom of page