Commitdd8ea62

committed

tree stuff

1 parent7702d47 commitdd8ea62Copy full SHA for dd8ea62

File tree

+100

-2

lines changed

+100

-2

lines changed

Lines changed: 23 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,23 @@`
	`1`	`+usecrate::TreeNode;`
	`2`	`+use std::cell::RefCell;`
	`3`	`+use std::rc::Rc;`
	`4`	`+pubstructSolution{}`
	`5`	`+implSolution{`
	`6`	`+pubfngood_nodes(root:Option<Rc<RefCell<TreeNode>>>) ->i32{`
	`7`	`+fnrec(root:Option<Rc<RefCell<TreeNode>>>,mutmax:i32) ->i32{`
	`8`	`+ifletSome(node) = root{`
	`9`	`+let node = node.borrow();`
	`10`	`+letmut count =0;`
	`11`	`+if node.val == max{`
	`12`	`+ count =1;`
	`13`	`+}elseif node.val > max{`
	`14`	`+ count =1;`
	`15`	`+ max = node.val;`
	`16`	`+}`
	`17`	`+return count +rec(node.left.clone(), max) +rec(node.right.clone(), max);`
	`18`	`+}`
	`19`	`+0`
	`20`	`+}`
	`21`	`+rec(root, i32::MIN)`
	`22`	`+}`
	`23`	`+}`

Lines changed: 27 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,27 @@`
	`1`	`+usecrate::TreeNode;`
	`2`	`+use std::cell::RefCell;`
	`3`	`+use std::rc::Rc;`
	`4`	`+pubstructSolution{}`
	`5`	`+implSolution{`
	`6`	`+pubfnkth_smallest(root:Option<Rc<RefCell<TreeNode>>>,k:i32) ->i32{`
	`7`	`+letmut stack:Vec<Rc<RefCell<TreeNode>>> =Vec::new();`
	`8`	`+letmut count =0;`
	`9`	`+letmut cur = root.clone();`
	`10`	`+while cur.is_some() \|\| !stack.is_empty(){`
	`11`	`+whileletSome(node) = cur{`
	`12`	`+ stack.push(node.clone());`
	`13`	`+let node = node.borrow();`
	`14`	`+ cur = node.left.clone();`
	`15`	`+}`
	`16`	`+ cur = stack.pop();`
	`17`	`+ count +=1;`
	`18`	`+let node = cur.unwrap();`
	`19`	`+let node = node.borrow();`
	`20`	`+if count == k{`
	`21`	`+return node.val;`
	`22`	`+}`
	`23`	`+ cur = node.right.clone();`
	`24`	`+}`
	`25`	`+ count`
	`26`	`+}`
	`27`	`+}`

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,5 +1,5 @@`
`1`		`-modlevel_order;`
`2`		`-uselevel_order::Solution;`
	`1`	`+modkth_smallest_bst;`
	`2`	`+usekth_smallest_bst::Solution;`
`3`	`3`	`use std::cell::RefCell;`
`4`	`4`	`use std::rc::Rc;`
`5`	`5`	`#[derive(Debug,PartialEq,Eq)]`

Lines changed: 27 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,27 @@`
	`1`	`+usecrate::TreeNode;`
	`2`	`+use std::cell::RefCell;`
	`3`	`+use std::rc::Rc;`
	`4`	`+pubstructSolution{}`
	`5`	`+implSolution{`
	`6`	`+pubfnright_side_view(root:Option<Rc<RefCell<TreeNode>>>) ->Vec<i32>{`
	`7`	`+use std::collections::VecDeque;`
	`8`	`+letmut q:VecDeque<Option<Rc<RefCell<TreeNode>>>> =VecDeque::new();`
	`9`	`+letmut res:Vec<i32> =Vec::new();`
	`10`	`+ q.push_back(root);`
	`11`	`+while !q.is_empty(){`
	`12`	`+let len = q.len();`
	`13`	`+letmut right =0;`
	`14`	`+for _iin0..len{`
	`15`	`+ifletSome(node) = q.pop_front().unwrap(){`
	`16`	`+let n = node.borrow();`
	`17`	`+ right = n.val;`
	`18`	`+ q.push_back(n.left.clone());`
	`19`	`+ q.push_back(n.right.clone());`
	`20`	`+}`
	`21`	`+}`
	`22`	`+ res.push(right);`
	`23`	`+}`
	`24`	`+`
	`25`	`+ res`
	`26`	`+}`
	`27`	`+}`

Lines changed: 21 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,21 @@`
	`1`	`+usecrate::TreeNode;`
	`2`	`+use std::cell::RefCell;`
	`3`	`+use std::rc::Rc;`
	`4`	`+pubstructSolution{}`
	`5`	`+implSolution{`
	`6`	`+pubfnis_valid_bst(root:Option<Rc<RefCell<TreeNode>>>) ->bool{`
	`7`	`+fnrec(root:Option<Rc<RefCell<TreeNode>>>,min:i64,max:i64) ->bool{`
	`8`	`+ifletSome(node) = root{`
	`9`	`+let node = node.borrow();`
	`10`	`+if(node.valasi64) > min &&(node.valasi64) < max{`
	`11`	`+returnrec(node.left.clone(), min, node.val.into())`
	`12`	`+ &&rec(node.right.clone(), node.val.into(), max);`
	`13`	`+}else{`
	`14`	`+returnfalse;`
	`15`	`+}`
	`16`	`+}`
	`17`	`+true`
	`18`	`+}`
	`19`	`+rec(root, i64::MIN, i64::MAX)`
	`20`	`+}`
	`21`	`+}`

Comments

(0)