Hint Assume the binary tree is properly balanced (the depth of the .pdf
0 likes6 views
The document provides guidance on implementing an algorithm for printing nodes in a balanced binary tree that fall within a specified range [k1, k2]. It emphasizes the importance of achieving an average runtime of o(k + log n), where k is the number of printed keys, and assumes the structure of the tree node in C++. The provided C++ code demonstrates the recursive method for traversing the tree and printing the appropriate nodes.
1 of 1
Download to read offline
Hint Assume the binary tree is properly balanced (the depth of the .pdf
- 1. Hint: Assume the binary tree is properly balanced (the depth of the tree T is O(log N)). For full credit, your algorithm should run in O(K+log N) average time, where K is the number of keys printed. Solution // Since the language is not specified, I'm doing it in C++. // Assumption: structure of the tree node: /* struct Node{ int data; Node *left; Node *right; }; */ void method(Node *root, int k1, int k2){ if(root == NULL) return; method(root->left); if(root->data >= k1 && root->data <= k2) cout << root->data << " "; method(root->right); }