int bstMedian(node *root, int n, int &x) { if (node->left) return bstMedian(root->left, n, x); x++; if (x == n/2) return node->val; if (node->right) return bstMedian(root->right, n, x); } call bstMedian(root, n, 0);
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.