L41. Ceil in a Binary Search Tree | BST | C++ | Java

Entire DSA Course: takeuforward.o...
Check our Website:
Linkedin/Instagram/Telegram: linktr.ee/take...
#treeSeries #striver #placements

[@AtharvaRao0104]

One practical implementation of this is in consistent hashing algorithm. To find the server where the data resides. We can maintain a balanced BST of the hash(IP) for all nodes .. when a key is to be stored or retrieved, the key is also hashed and the successor of this hash(key) is searched in this balanced BST.

[@datkumar1024]

Recursive solution: int func(BinaryTreeNode *curr,int key, int &ceil) { if(!curr) return ceil; if(curr->data == key) return ceil = key; if(curr->data > key) { ceil = curr->data; return func(curr->left, key, ceil); } return func(curr->right, key, ceil); } int findCeil(BinaryTreeNode *root, int key){ int ceil = -1; ceil = func(root,key,ceil); return ceil; }

[@udayrajvadeghar8555]

Amazing concept explaining !!

[@SHASHANKRUSTAGII]

Next greater number in BST on INTERVIEWBIT.

[@ciaassasian]

shashank bhaiya op! spotted again

[@ankitpundir_]

The best playlist on TREE. better version of code int findCeil(BinaryTreeNode *node, int x){ int ceil = -1; BinaryTreeNode *curr = node; while(curr!= NULL){ if(curr->data >= x){ ceil = curr->data; if(ceil == x){ break; } curr = curr->left; } else{ curr = curr->right; } } return ceil; }

[@takeUforward]

Please likeeee, shareeee and subscribeeeeeeee :) Also follow me at Insta: Striver_79

[@stith_pragya]

Thank You So Much for this wonderful video.............🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻

[@akashpurbia4390]

Recursive Solution: // Function to return the ceil of given number in BST. int Ceil=-1; //Global Variable int findCeil(Node* root, int input) { if (root == NULL) return Ceil; // Your code here if(root->data==input) { Ceil = root->data; return Ceil; //if input is found then ceil will be that only } if(root->data>input) { Ceil = root->data; //update the ceil(immediately greater than input) } if(inputdata) return findCeil(root->left,input); else return findCeil(root->right,input); }

[@tharungr7701]

int ceilAns = -1; BinaryTreeNode* curr = node; while(curr) { if(curr->data >= x) { ceilAns = curr->data; curr= curr->left; } else{ curr= curr->right; } } return ceilAns; simple as that

[@ajayagrawal2067]

Using a while loop will be a good answer, because if we use recursion that is adding some extra space which the interviewer might not like.

[@priyanshkumar17]

Yeah!! You're right

[@brokegod5871]

Here's the recursive solution, there's no issue of extra spaces though? void solve(Node* root, int input, int &ans) { if(root==NULL) return; if(root->data == input) { ans = root->data; return; } if(input > root->data) { solve(root->right, input, ans); } else { ans = root->data; solve(root->left, input, ans); } } int findCeil(Node* root, int input) { int ans = -1; solve(root, input, ans); return ans; }

[@yashverma2986]

int ceil=-1; while(node!=NULL) { if(node->data>x){ ceil=node->data; node=node->left; } else if(node->dataright; } else if(node->data==x) { return node->data; } } return ceil;

[@ganeshjaggineni4097]

NICE SUPER EXCELLENT MOTIVATED

[@rushikeshjadhav6346]

Your Intro BGM boosts my moral!

[@abhishekgusain6084]

Thankyou very much sir, for all of these videos, I'm really grateful for them. I'll surely crack google just like you did.

[@DeadPoolx1712]

UNDERSTOOD;

[@UECAshutoshKumar]

Thank you sir

[@shipranshikeshri9210]

int findCeil(Node* root, int input) { if (root == NULL) return -1; int ans = INT_MAX; while(root != NULL ){ if(root->data >=input){ ans = min(ans,root->data); root = root->left; } else{ root = root->right; } // cout

[@apmotivationakashparmar722]

Thank you so much !

[@paraskamboj1039]

thankyou so much sir ji

[@kanishkkala16]

guys isnt this the floor of the bst problem, val >= k is used for the floor right, i have seen his whole binary search playlist, even in that finding floor is done using arr[mid] >= k right

[@striverdaaadi]

awesome videos bhaijaan😍😍

[@KartikeyTT]

tysm sir

[@himanshidafouty347]

Understood

[@GeneralistDev]

SelfNote:- Solved myself

[@akhilesh59]

Understood...

[@jatilyadav4000]

Definately Yess...

[@codeman3828]

Thanks. Understood

[@alesblaze4745]

thanks mate!

[@brokegod5871]

Recursive Solutions: *Ceil in BST* void solve(Node* root, int input, int &ans) { if(root==NULL) return; if(root->data == input) { ans = root->data; return; } if(input > root->data) { solve(root->right, input, ans); } else { ans = root->data; solve(root->left, input, ans); } } int findCeil(Node* root, int input) { int ans = -1; solve(root, input, ans); return ans; } *Floor in BST* void solve(Node* root, int input, int &ans) { if(root==NULL) return; if(root->data == input) { ans = root->data; return; } if(input < root->data) { solve(root->left, input, ans); } else { ans = root->data; solve(root->right, input, ans); } } int floor(Node* root, int x) { int ans = -1; solve(root, x, ans); return ans; }

[@harshitjaiswal9439]

understood.

[@chiragbansod8252]

understood

[@PrinceKumar-el7ob]

exactly similar to finding ceil in sorted order!

[@rpspsprp]

Ye question leet code per nii hai sayad

[@jambajuice07]

you are doing extremely very well striver

[@sujan_kumar_mitra]

Understood

[@mohdhammadsiddiqui7598]

In coding ninjas i think sample input for X=7 is given wrong ceil should be 7 not 8

[@tusharnain6652]

Coding Ninjas Sucks!

[@studyaccount794]

@@tusharnain6652 Yeah, it's like that pirated game you download from pirate bay lol. Highly compressed 1mb leetcode 100% working, no virus.

[@tusharnain6652]

@@studyaccount794 LOL, those highly compressed games took forever to install

[@tusharnain6652]

@Ayush Negi yes!

[@harshalgarg1149]

Thanks.

[@rishabhkumar8115]

NIce!!!

[@letscodewithshivam]

This is similar to finding successor in BST for a key.. right ?

[@parthsalat]

Yes, check it on interviewbit

[@tps8470]

Done

[@Ani-zi5he]

"Understood"

[@shivangisrivastava1158]

smooth!

[@sangammishra3670]

i think in the above example if you have 7 in the left of 9 then in that case it will return value 7

[@harshjha1626]

No, it will return 9 only

[@shivamtharwani4057]

in that case it returns 10 as of eg.

[@umarqureshi8499]

Amazing.

[@mayankraj527]

Nice explanation

[@pratapsingh9638]

understood

[@prathameshpawar346]

nicely done

[@abhishek__anand__]

Nice

[@lavanyaprakashjampana933]

we love your content and we love you...🖤

[@pratapsingh9638]

@striver bhai please make videos on bit manipulation and segment tree

[@chirlasowmyareddy]

this is raj sir's video.. hope this is helpful.. www.youtube.com/@CodeBeyond/playlists?view=50&shelf_id=2

[@t-anime517]

Understood 😊

[@ashwinrai123]

Amazing....

[@nileshsinha7869]

UNDERSTOOD

[@b_31mahammadzubair81]

In the BST shown in question what if 7 is there instead of 9. What will it return??

[@chiragkhemani1615]

If there would have been 7 , we have not taken that and moved to right that is NULL and return stored ans that is 10 (ceil of this tree when key = 8)

[@bilalkhan2298]

dhoni❤

[@abhimanyuthapliyal5823]

US

[@Ayush-lq3fz]

understood :)))))

[@p38_amankuldeep75]

💝💝💝

[@ajayypalsingh]

💚

[@shubamgoswami]

done completed

[@Kpriyasing]

Amazing content!

[@TheDev05]

@@parthgupta0824 are you a boy or girl?

[@Telugu_europe]

US

[@jambajuice07]

void help(Node* root , int target , int &ans){ if(root== NULL) return ; if(root->data== target){ ans = target; return ; } else if(root->data > target){ ans = min(ans , root->data); help(root->left , target,ans); }else{ help(root->right, target,ans); } } int findCeil(Node* root, int input) { if (root == NULL) return -1; int ans =1e9; help(root, input , ans); if(ans==1e9) return -1; }

[@piyushacharya7696]

reach++

[@HarryThakur-f6u]

hey everyone? can someone please tell me which question number is this on leetcode!

[@shibasishdas4107]

Can there be a better version of this code in recurssive solution: private TreeNode ceil(TreeNode root, int val) { if(root == null) return null; if(root.val == val) return root; if(val < root.val) { TreeNode left = ceil(root.left, val); return (left == null) ? root : left; } else { TreeNode right = ceil(root.right, val); return (right == null) ? null : right; } }

[@suvanshmahajan5902]

"us"

[@mriduljain1981]

us.

[@K-EC-AmanKumar]

in Mahi's word😂

[@KaushikSharma-c3q]

.....................

[@hemankpandya989]

codestudio chutiya hai......kabhi accept nhi hota waha

[@SibiRanganathL]

understood

[@filmcrux64711]

understood

[@roopeshn3301]

Understood

[@rishabhgupta9846]

UNDERSTOOD