1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19
| fn main(){ print!("Morris中序遍历:"); let nums =vec![6,2,7,1,4,-1,9,-1,-1,3,5,8,-1]; let head =TreeNode::from_vec(nums); let nums=TreeNode::inorder_morris_traversal(head); println!("{:?}",nums);
print!("Morris先序遍历:"); let nums =vec![1,2,7,3,4,-1,8,-1,-1,5,6,9,-1]; let head =TreeNode::from_vec(nums); let nums=TreeNode::preorder_morris_traversal(head); println!("{:?}",nums);
print!("Morris后序遍历:"); let nums =vec![9,5,8,1,4,-1,7,-1,-1,2,3,6,-1]; let head =TreeNode::from_vec(nums); let nums=TreeNode::postorder_morris_traversal(head); println!("{:?}",nums); }
|