Trees and Transversals

Question 1

What is in order transversal

Answer 1

Left → Root → Right

Question 2

What is Preorder transversal

Answer 2

Root → Left → Right

Question 3

What is Postorder transversal

Answer 3

Left → Right → Root

Question 4

Why are AVL trees used

Answer 4

They are self-balancing BSTs, maintaining O(log n) operations

Question 5

What’s the height of a complete binary tree with 15 nodes?

Answer 5

3 (0-based), since 15 = 2⁴ - 1

Question 6

What property defines a min-heap?

Answer 6

Every parent is less than or equal to its children.

Question 7

What’s the minimum number of nodes in an AVL tree of height h

Answer 7

F(h+2) − 1, where F is the Fibonacci sequence

Question 8

In an AVL tree, what balance factor range is valid

Answer 8

Must be -1, 0, or +1

Question 9

What is the balance factor of a leaf node in an AVL tree

Answer 9

0 — both left and right heights are -1

Question 10

What’s the result of deleting the root in a BST and replacing it with a value from the right subtree?

Answer 10

The smallest value from the right subtree replaces the root

Question 11

Can a min-heap also be a binary search tree?

Answer 11

No — BSTs must satisfy in-order value rules, heaps only structural.