Method dequeue

publication/code/chapter08/binary_tree.rs:38–44

(&mut self)

    }

    fn dequeue(&mut self) -> Option<T> {
        if self.len() > 0 {
            self.data.pop()
        } else {
            None
        }
    }
}

// 二叉树子节点链接