[−][src]Struct leetcode_prelude::TreeNode
Definition for a binary tree node.
Note
I add Ord PartialOrd for sort Vec
Fields
val: i32
left: Option<Rc<RefCell<TreeNode>>>
right: Option<Rc<RefCell<TreeNode>>>
Implementations
impl TreeNode
[src]
Trait Implementations
impl Debug for TreeNode
[src]
impl Eq for TreeNode
[src]
impl Ord for TreeNode
[src]
fn cmp(&self, other: &TreeNode) -> Ordering
[src]
#[must_use]fn max(self, other: Self) -> Self
1.21.0[src]
#[must_use]fn min(self, other: Self) -> Self
1.21.0[src]
#[must_use]fn clamp(self, min: Self, max: Self) -> Self
[src]
impl PartialEq<TreeNode> for TreeNode
[src]
impl PartialOrd<TreeNode> for TreeNode
[src]
fn partial_cmp(&self, other: &TreeNode) -> Option<Ordering>
[src]
fn lt(&self, other: &TreeNode) -> bool
[src]
fn le(&self, other: &TreeNode) -> bool
[src]
fn gt(&self, other: &TreeNode) -> bool
[src]
fn ge(&self, other: &TreeNode) -> bool
[src]
impl StructuralEq for TreeNode
[src]
impl StructuralPartialEq for TreeNode
[src]
Auto Trait Implementations
impl !RefUnwindSafe for TreeNode
impl !Send for TreeNode
impl !Sync for TreeNode
impl Unpin for TreeNode
impl !UnwindSafe for TreeNode
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,