前言

我們可以利用Stack的資料結構做出簡易的貪食蛇

前言

了解了遞迴的用法我們就可以用遞迴幫忙我們解出迷宮的走法

Difficult:Easy

題目

Given the root of a binary tree, check whether it is a mirror of itself (i.e., symmetric around its center).

Difficult:Easy

題目

Given the roots of two binary trees p and q, write a function to check if they are the same or not.

Two binary trees are considered the same if they are structurally identical, and the nodes have the same value.

Difficult:Medium

題目

Given the root of a binary tree, determine if it is a valid binary search tree (BST).

A valid BST is defined as follows:

The left subtree of a node contains only nodes with keys less than the node’s key.
The right subtree of a node contains only nodes with keys greater than the node’s key.
Both the left and right subtrees must also be binary search trees.