MCPcopy Create free account
hub / github.com/QMHTMY/RustBook / order

Function order

publication/code/chapter08/rbtree.rs:914–929  ·  view source on GitHub ↗
()

Source from the content-addressed store, hash-verified

912 }
913
914 fn order() {
915 let mut rbt = RBTree::<usize, u32>::new();
916 let nums = [0,1,2,3,4,5,6,7,8,9];
917 for (k, &v) in nums.iter().enumerate() {
918 rbt.insert(k, v);
919 }
920
921 println!("internal preoder:");
922 rbt.preorder();
923 println!("internal inoder:");
924 rbt.inorder();
925 println!("internal postoder:");
926 rbt.postorder();
927 println!("internal levelorder:");
928 rbt.levelorder();
929 }
930
931 fn get() {
932 let mut rbt = RBTree::<usize, char>::new();

Callers 1

mainFunction · 0.70

Calls 6

iterMethod · 0.45
insertMethod · 0.45
preorderMethod · 0.45
inorderMethod · 0.45
postorderMethod · 0.45
levelorderMethod · 0.45

Tested by

no test coverage detected