Thanks for using Compiler Explorer
Sponsors
Jakt
C++
Ada
Analysis
Android Java
Android Kotlin
Assembly
C
C3
Carbon
C++ (Circle)
CIRCT
Clean
CMake
CMakeScript
COBOL
C++ for OpenCL
MLIR
Cppx
Cppx-Blue
Cppx-Gold
Cpp2-cppfront
Crystal
C#
CUDA C++
D
Dart
Elixir
Erlang
Fortran
F#
Go
Haskell
HLSL
Hook
Hylo
ispc
Java
Julia
Kotlin
LLVM IR
LLVM MIR
Modula-2
Nim
Objective-C
Objective-C++
OCaml
OpenCL C
Pascal
Pony
Python
Racket
Ruby
Rust
Snowball
Scala
Solidity
Spice
Swift
LLVM TableGen
Toit
TypeScript Native
V
Vala
Visual Basic
Zig
Javascript
GIMPLE
rust source #1
Output
Compile to binary object
Link to binary
Execute the code
Intel asm syntax
Demangle identifiers
Filters
Unused labels
Library functions
Directives
Comments
Horizontal whitespace
Debug intrinsics
Compiler
BPF gcc (trunk)
mrustc (master)
rustc 1.0.0
rustc 1.1.0
rustc 1.10.0
rustc 1.11.0
rustc 1.12.0
rustc 1.13.0
rustc 1.14.0
rustc 1.15.1
rustc 1.16.0
rustc 1.17.0
rustc 1.18.0
rustc 1.19.0
rustc 1.2.0
rustc 1.20.0
rustc 1.21.0
rustc 1.22.0
rustc 1.23.0
rustc 1.24.0
rustc 1.25.0
rustc 1.26.0
rustc 1.27.0
rustc 1.27.1
rustc 1.28.0
rustc 1.29.0
rustc 1.3.0
rustc 1.30.0
rustc 1.31.0
rustc 1.32.0
rustc 1.33.0
rustc 1.34.0
rustc 1.35.0
rustc 1.36.0
rustc 1.37.0
rustc 1.38.0
rustc 1.39.0
rustc 1.4.0
rustc 1.40.0
rustc 1.41.0
rustc 1.42.0
rustc 1.43.0
rustc 1.44.0
rustc 1.45.0
rustc 1.45.2
rustc 1.46.0
rustc 1.47.0
rustc 1.48.0
rustc 1.49.0
rustc 1.5.0
rustc 1.50.0
rustc 1.51.0
rustc 1.52.0
rustc 1.53.0
rustc 1.54.0
rustc 1.55.0
rustc 1.56.0
rustc 1.57.0
rustc 1.58.0
rustc 1.59.0
rustc 1.6.0
rustc 1.60.0
rustc 1.61.0
rustc 1.62.0
rustc 1.63.0
rustc 1.64.0
rustc 1.65.0
rustc 1.66.0
rustc 1.67.0
rustc 1.68.0
rustc 1.69.0
rustc 1.7.0
rustc 1.70.0
rustc 1.71.0
rustc 1.72.0
rustc 1.73.0
rustc 1.74.0
rustc 1.75.0
rustc 1.76.0
rustc 1.8.0
rustc 1.9.0
rustc beta
rustc nightly
rustc-cg-gcc (master)
x86-64 GCCRS (GCC master)
x86-64 GCCRS (GCCRS master)
Options
Source code
use std::cmp::Ordering; #[derive(Debug)] struct Node<T: Ord> { key: T, left: Tree<T>, right: Tree<T>, } #[derive(Debug)] struct Tree<T: Ord>(Option<Box<Node<T>>>); #[derive(Debug)] pub struct BinarySearchTree<T: Ord> { root: Tree<T>, } impl<T: Ord> Node<T> { fn new(value: T) -> Self { Node { key: value, left: Tree(None), right: Tree(None), } } } impl<T: Ord> Tree<T> { fn add(&mut self, value: T) { let mut current = self; while let Some(ref mut node) = current.0 { match node.key.cmp(&value) { Ordering::Less => current = &mut node.right, Ordering::Greater => current = &mut node.left, Ordering::Equal => current = &mut node.right, } } current.0 = Some(Box::new(Node::new(value))); } fn successor(&self, value: &T) -> Option<&T> { let mut current = self.0.as_ref(); let mut successor = None; while current.is_some() { let node = current.unwrap(); if *value < node.key { successor = current; current = node.left.0.as_ref(); } else { current = node.right.0.as_ref(); } } successor.map(|node| &node.key) } fn extract_min(&mut self) -> Option<T> { let mut node = None; if self.0.is_some() { let mut current = self; while current.0.as_ref().unwrap().left.0.is_some() { current = &mut current.0.as_mut().unwrap().left; } let temp = current.0.take().unwrap(); node = Some(temp.key); current.0 = temp.right.0; } node } fn extract_max(&mut self) -> Option<T> { let mut node = None; if self.0.is_some() { let mut current = self; while current.0.as_ref().unwrap().right.0.is_some() { current = &mut current.0.as_mut().unwrap().right; } let temp = current.0.take().unwrap(); node = Some(temp.key); current.0 = temp.left.0; } node } fn remove(&mut self, value: &T) { let mut current = self; while let Some(ref mut node) = current.0 { match node.key.cmp(value) { Ordering::Less => current = &mut node.right, Ordering::Greater => current = &mut node.left, Ordering::Equal => match (node.left.0.as_mut(), node.right.0.as_mut()) { (None, None) => current.0 = None, (Some(_), None) => current.0 = node.left.0.take(), (None, Some(_)) => current.0 = node.right.0.take(), (Some(_), Some(_)) => { current.0.as_mut().unwrap().key = node.right.extract_min().unwrap(); } }, } } } } impl<T: Ord> BinarySearchTree<T> { pub fn new() -> Self { BinarySearchTree { root: Tree(None) } } pub fn add(&mut self, value: T) { self.root.add(value); } pub fn remove(&mut self, value: &T) { self.root.remove(value); } pub fn successor(&self, value: &T) -> Option<&T> { self.root.successor(value) } }
Become a Patron
Sponsor on GitHub
Donate via PayPal
Source on GitHub
Mailing list
Installed libraries
Wiki
Report an issue
How it works
Contact the author
CE on Mastodon
About the author
Statistics
Changelog
Version tree