Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- // Author : jb
- #include <bits/stdc++.h>
- using namespace std;
- class node
- {
- int val;
- node* left;
- node* right;
- }
- void inorder(node* root, int k)
- {
- if(root->left == NULL && root->right == NULL)
- {
- return;
- }
- if(root->right != NULL)
- inorder(root->right,k);
- k--;
- if(k == 1) // ?? k = 0 OR 1
- {
- return root->val;
- }
- if(root->left != NULL)
- inorder(root->left,--k);
- }
- int find_kth_largest(node* root, int k)
- {
- return (inorder(root,k));
- }
- int32_t main()
- {
- node* root = new node()
- }
- // 7 k = 2
- // / \
- // 5 9
- // / \ / \ // 0 1 2 3 4 5 6 n = 7
- // 3 6 8 10 // 3 5 6 7 8 9 10 arr[n - k]
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement