Enerzinx System Software Engineer Interview Questions and Answers

Time complexity of binary tree operations is O(log n) for balanced trees and O(n) for unbalanced trees.

• Balanced binary trees have a time complexity of O(log n) for operations like search, insert, and delete.

• Unbalanced binary trees have a time complexity of O(n) for operations like search, insert, and delete.

• Examples: AVL trees, Red-Black trees are balanced trees with O(log n) time complexity. Binary search trees can be

Type of traversal refers to the method used to visit all nodes in a data structure.

• There are three main types of traversal: in-order, pre-order, and post-order.

• In-order traversal visits left subtree, current node, then right subtree.

• Pre-order traversal visits current node, left subtree, then right subtree.

• Post-order traversal visits left subtree, right subtree, then current node.