# Top 20 interview questions on binary trees

Binary tree is very basic data structure in software program. below is top 20 interview questions on binary trees that are commonly asked during software job’s interview.

*construct binary tree from inorder and post order traversal**construct binary tree from preorder and inorder traversal**construct binary tree from preorder and postorder traversal**construct binary tree from parent array**find closest node in a Binary Search Tree**write c program to delete a binary tree**write c program to count leaf nodes in binary tree**find height of a binary tree**Write C code to Check Binary tree is BST or Not**Print all path of binary tree ,Path from root to leaf node**How to check whether a Binary tree is subtree of another binary tree**what is difference between binary tree and binary search tree?**Check if Binary Tree is Height Balanced?**Spiral traversal of binary tree**Write C program to search for a value in a binary search tree**find if two binary trees are identical**What are the applications of binary trees?**Difference between “Complete binary tree”, “strict binary tree”,“full binary Tree”?**Convert a Binary Tree into an Array in C**find min and max node of a binary tree*

## Leave a Reply