/* * File: binary_tree_dfs.rs * Created Time: 2023-04-06 * Author: xBLACKICEx (xBLACKICE@outlook.com) */ use hello_algo_rust::include::{print_util, vec_to_tree, TreeNode}; use hello_algo_rust::op_vec; use std::cell::RefCell; use std::rc::Rc; /* Preorder traversal */ fn pre_order(root: Option<&Rc>>) -> Vec { let mut result = vec![]; fn dfs(root: Option<&Rc>>, res: &mut Vec) { if let Some(node) = root { // Visit order: root -> left subtree -> right subtree let node = node.borrow(); res.push(node.val); dfs(node.left.as_ref(), res); dfs(node.right.as_ref(), res); } } dfs(root, &mut result); result } /* Inorder traversal */ fn in_order(root: Option<&Rc>>) -> Vec { let mut result = vec![]; fn dfs(root: Option<&Rc>>, res: &mut Vec) { if let Some(node) = root { // Visit order: left subtree -> root -> right subtree let node = node.borrow(); dfs(node.left.as_ref(), res); res.push(node.val); dfs(node.right.as_ref(), res); } } dfs(root, &mut result); result } /* Postorder traversal */ fn post_order(root: Option<&Rc>>) -> Vec { let mut result = vec![]; fn dfs(root: Option<&Rc>>, res: &mut Vec) { if let Some(node) = root { // Visit order: left subtree -> right subtree -> root let node = node.borrow(); dfs(node.left.as_ref(), res); dfs(node.right.as_ref(), res); res.push(node.val); } } dfs(root, &mut result); result } /* Driver code */ fn main() { /* Initialize the binary tree */ // Use a helper function that builds a binary tree directly from an array let root = vec_to_tree(op_vec![1, 2, 3, 4, 5, 6, 7]); println!("Initialize the binary tree\n"); print_util::print_tree(root.as_ref().unwrap()); /* Preorder traversal */ let vec = pre_order(root.as_ref()); println!("\nNode sequence from preorder traversal = {:?}", vec); /* Inorder traversal */ let vec = in_order(root.as_ref()); println!("\nNode sequence from inorder traversal = {:?}", vec); /* Postorder traversal */ let vec = post_order(root.as_ref()); print!("\nNode sequence from postorder traversal = {:?}", vec); }