2025年3月24日

LeetCode - Construct Binary Tree Preorder and Inorder Traversal

摘要： Given two integer arrays preorder and inorder where preorder is the preorder traversal of a binary tree and inorder is the inorder traversal of the sa 阅读全文

posted @ 2025-03-24 22:26 ZhangZhihuiAAA 阅读(4) 评论(0) 推荐(0)

LeetCode - Symmetric Tree

摘要： Given the root of a binary tree, check whether it is a mirror of itself (i.e., symmetric around its center). Example 1: Input: root = [1,2,2,3,4,4,3] 阅读全文

posted @ 2025-03-24 09:22 ZhangZhihuiAAA 阅读(19) 评论(0) 推荐(0)


博客园 © 2004-2026 浙公网安备 33010602011771号浙ICP备2021040463号-3

导航

2025年3月24日