Freaks City

Recovering a Swapped Binary Search Tree A binary search tree (BST) has two of its nodes swapped by mistake. The task is to restore the tree to its correct BST form without altering its structure. The challenge is to achieve this with constant space complexity (O(1) space), avoiding the use of a full in-order traversal list. Approach The key obs ...

Greedy Algorithm: Minimum Cameras to Monitor a Binary Tree Given a binary tree, we need to place cameras on nodes such that every node in the tree is monitored. A camera placed on a node monitors itself, its parenet, and its immediate children. Determine the minimum number of cameras required. Approach We can solve this problem using a greedy a ...

1. The time complexity of an algorithm primarily depends on ( ). A. Problem size B. CPU clock speed C. Source code length D. Quality of the compiled binary Answer: A 2. For a sequential list containing n elements, inserting a new element while preserving the existing order requires shifting ( ) elements on average. A. n B. n/2 C. 2n D. n² Answe ...

What Is a Tree Data Structure A tree represents a non-linear data structure composed of n (n>=0) finite nodes organized in a hierarchical manner. The hierarchical nature means the structure is no longer one-to-one like linear structures, but rather one-to-many, where the number of elements at each level varies based on relationships with par ...