evaluate_boolean_binary_tree_2331.rs

// TODO : Revisit this problem, and solve it again. I'm feeling either a recursive solution, or a DFS would do it. I'm too tired to work on it rn
// A match statement with the 4 options for variable types, I dunno
use crate::Solution;
use crate::TreeNode;
use std::borrow::Borrow;
// Definition for a binary tree node.
// #[derive(Debug, PartialEq, Eq)]
// pub struct TreeNode {
//   pub val: i32,
//   pub left: Option<Rc<RefCell<TreeNode>>>,
//   pub right: Option<Rc<RefCell<TreeNode>>>,
// }
// 
// impl TreeNode {
//   #[inline]
//   pub fn new(val: i32) -> Self {
//     TreeNode {
//       val,
//       left: None,
//       right: None
//     }
//   }
// }
use std::rc::Rc;
use std::cell::RefCell;
impl Solution {
    pub fn evaluate_tree(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
    }
}