2023年2月8日
297. Serialize and Deserialize Binary Tree[Hard]
摘要： 297. Serialize and Deserialize Binary Tree Serialization is the process of converting a data structure or object into a sequence of bits so that it ca 阅读全文
posted @ 2023-02-08 23:20 AaronTanooo 阅读(23) 评论(0) 推荐(0)
124. Binary Tree Maximum Path Sum[Hard]
摘要： 124. Binary Tree Maximum Path Sum A path in a binary tree is a sequence of nodes where each pair of adjacent nodes in the sequence has an edge connect 阅读全文
posted @ 2023-02-08 22:39 AaronTanooo 阅读(24) 评论(0) 推荐(0)
105. Construct Binary Tree from Preorder and Inorder Traversal[Medium]
摘要： 105. Construct Binary Tree from Preorder and Inorder Traversal Given two integer arrays preorder and inorder where preorder is the preorder traversal 阅读全文
posted @ 2023-02-08 22:15 AaronTanooo 阅读(26) 评论(0) 推荐(0)
230. Kth Smallest Element in a BST[Medium]
摘要： 230. Kth Smallest Element in a BST Given the root of a binary search tree, and an integer k, return the kth smallest value (1-indexed) of all the valu 阅读全文
posted @ 2023-02-08 21:20 AaronTanooo 阅读(20) 评论(0) 推荐(0)
98. Validate Binary Search Tree[Medium]
摘要： ##98. Validate Binary Search Tree Given the root of a binary tree, determine if it is a valid binary search tree (BST). A valid BST is defined as foll 阅读全文
posted @ 2023-02-08 15:05 AaronTanooo 阅读(28) 评论(0) 推荐(0)