You are required to serialize a binary tree into a string such that when needed, it can be reconstructed to the same tree.

You are required to serialize a binary tree into a string such that when needed, it can be reconstructed to the same tree.

题目类型: 技术面试题

这是一道技术面试题，常见于澳洲IT公司面试中。

难度: easy

标签: interviewbit, genc, topic-specific, general-programming

参考答案摘要

Example - Given tree If we consider the serialization of the tree by breadth-first traversal or level order traversal. Then the string can be like - “2,4,9,13,15,1,6,7,X,3,9,X,10,X,14,X,9,X,X,X,X,X,X,...

本题提供 STAR 原则详细解答和技术解析，登录匠人学院学习中心即可查看完整答案。