Leetcode 894. All Possible Full Binary Trees

[@probabilitycodingisfunis1]

unordered_mapdp; vector allPossibleFBT(int n) { if(n%2==0)return {}; if(n==1)return {new TreeNode()}; if(dp.find(n)!=dp.end())return dp[n]; vectorans; for(int i=1;ileft = l; node->right = r; ans.push_back(node); } } } return dp[n] = ans; }

[@bajrangsinha2546]

1) explanation up to mark, clear and concise. 2) no asking for like and subscribe. That's why i liked and subscribed to your channel. 3)quality content. 4) after watching your videos it gives me more confidence in dsa. Thanks 🙏

[@priyabratadas2392]

Thank you !! Almost every problem seems simpler after its explained by you!!

[@greatred2558]

It’s good to see you again 😊

[@Ujjwal7120]

I recently discovered this channel Wow your explanation are so simple and good

[@aadil4236]

You're back!! And with leetcode premium this time. Bade log. Good to see you back.

[@leetcoder1159]

Was missing you 😅 Leetcode Queen 👑

[@p25_rhythm70]

nice to see you back your explanations are very good and on point

[@OpeLeke]

Thanks Alisha

[@tindo0038]

amazing explanation. thank you.

[@leetcoder1159]

One video on how to improve communication skills for coding interview

[@manishkumar-uw5mw]

Good to see you again 🥳🥳

[@shivanshgupta1509]

Welcome back!!

[@Idukhan-jj9kc]

Ma'am good to see🎉🎉please continue

[@sayansen0361]

Happy belated teacher's day ma'am

[@Code_express]

finally after many days

[@mayankshakya9200]

When you completed yr btech and from where ?

[@AnujSharma-ro4kc]

Welcome back after sooo long 😊

[@raushankumar6993]

Welcome back☺☺

[@HuzaifaBilal-fo7zc]

Make video on Print combinations of r elements in an array of size n

[@srivastavkumar5497]

Thank you mam

[@dharmeshpanchal1642]

Fantastic 🎊👌👌

[@anshulgoel1940]

Why is no one talking about time complexity ?

[@mustafizurrahman1560]

This channel is alive?

[@mukulkhanna5071]

can anyone pls share time complexity??? I am bit confused

[@ASHUTOSHSHARMA-h4w]

God made you beautiful and intelligent ❤. Thank you for the help

[@Abubakar91718]

message to all learner, dont forget to subscribe to this channel.

[@harshmishra3524]

jai shree ram

[@DURGESHKUMAR-pu4wq]

I thought you forgot your Chanel password 😂

[@probabilitycodingisfunis1]

😂😂😂

[@TheViral_fyp]

Are you alive Mam ?

[@mathematics6199]

Didi did you got laid off from ms?

[@ozzy-fr7vj]

Rust implementation -> // Definition for a binary tree node. // #[derive(Debug, PartialEq, Eq)] // pub struct TreeNode { // pub val: i32, // pub left: Option, // pub right: Option, // } // // impl TreeNode { // #[inline] // pub fn new(val: i32) -> Self { // TreeNode { // val, // left: None, // right: None // } // } // } use std::{rc::Rc, cell::RefCell, collections::HashMap}; type T = Option; macro_rules! treeNode { ($n:expr) => { Some(Rc::new(RefCell::new(TreeNode::new($n)))) }; ($a:expr, $b:expr) => { Some(Rc::new(RefCell::new(TreeNode { val: 0, left: $a, right: $b, })))}; } impl Solution { pub fn all_possible_fbt(n: i32) -> Vec { fn bk(n: i32, dp: &mut HashMap) -> Rc { match n { 0 => dp.get(&0).unwrap().clone(), 1 => dp.get(&1).unwrap().clone(), _ if dp.contains_key(&n) => dp.get(&n).unwrap().clone(), _ => { let mut res = Vec::new(); for l in (1..n).step_by(2) { let r = n - 1 - l; for t1 in bk(l, dp).iter() { for t2 in bk(r, dp).iter() { res.push(treeNode!(t1.clone(), t2.clone())); } } } let res = Rc::new(res); dp.insert(n, res.clone()); res } } } let result = bk( n, &mut HashMap::from([ (0, Rc::new(Vec::::new())), (1, Rc::new(vec![treeNode!(0)])), ])); Rc::try_unwrap(result).unwrap() } }