Questions
5 of 26
1What is the difference between a B-Tree and a B+ Tree? Why are B+ Trees better for disk access?
2What is a Complete Binary Tree? A Full Binary Tree? A Perfect Binary Tree?
3What is a Segment Tree? What problems does it solve?
4What is an AVL Tree? What is a Red-Black Tree? What is the difference?
5How do you check if a tree is symmetric (Mirror image)?
6What is a Balanced Tree? Why do we need balance?
7How does a Trie compare to a Hash Table for string storage?
8What is Heapify? Explain the process.
9What is the time complexity of insertion and deletion in a Heap? Why?
10What is a Trie (Prefix Tree)? When is it used?
11How is a Heap implemented using an Array? (Parent/Child index math)
12Explain Tree Traversals: Inorder, Preorder, Postorder, Level Order.
13How do you implement Inorder traversal iteratively? (Without recursion)
14Explain the concept of Tree Rotation.
15What is a Binary Tree?
16Why do databases prefer B-Trees/B+ Trees over Binary Search Trees?
17What is the difference between a Binary Tree and a Binary Search Tree?
18What is a Tree? Define Node, Root, Leaf, Edge, Height, Depth.
19What is a Binary Search Tree (BST)? What are its properties?
20What is a Fenwick Tree (Binary Indexed Tree)?
21How do you find the Lowest Common Ancestor (LCA) of two nodes in a BST?
22What is a Splay Tree? When would you use it?
23How do you serialize and deserialize a Binary Tree?
24How do you validate if a given Tree is a valid BST?
25What is a Heap? (Min-Heap and Max-Heap)
26How do you find the diameter of a Binary Tree?
