'leetcode 331 풀이 자바' 태그의 글 목록

728x90

[LeetCode - Daily Challenge] 331. Verify Preorder Serialization of a Binary Tree

Problem One way to serialize a binary tree is to use preorder traversal. When we encounter a non-null node, we record the node's value. If it is a null node, we record using a sentinel value such as '#'. For example, the above binary tree can be serialized to the string "9,3,4,#,#,1,#,#,2,#,6,#,#", where '#' represents a null node. Given a string of comma-separated values pre..

Algorithm/LeetCode Daily Challenge 2021. 8. 27. 10:30

728x90