将二进制树保存到文件 [英] Saving a Binary tree to a file

问题描述

我有一个非平衡（不是二进制搜索）二进制树
需要将其（并后来解码）转换为txt文件。
我该如何以有效的方式执行？

I have a non-balanced (not binary-search) binary tree Need to incode (and later decode) it to txt file. How can I do it in efficient way?

我发现这个 link
，它谈到类似（相同）的问题，但对我而言很明显

I found this link which talks about similar (same) problem,but it is obvious for me

推荐答案

请参阅 LeetCode 。

我喜欢这个解决方案，因为它比较有效率并产生光输出文件。

I like this solution because it's relatively efficient and produces light output files.

假设你有一个这样的树：

Assuming that you've got a tree like this:

    _30_ 
   /    \    
  10    20
 /     /  \ 
50    45  35

此解决方案可让您将其序列化为这样的输出文本文件：

This solution lets you serialize it to such an output text file:

30 10 50 # # # 20 45 # # 35 # #

要做到这一点，可以通过树执行简单的预订遍历：

To do this it's enough to perform simple pre-order traversal through the tree:

void writeBinaryTree(BinaryTree *p, ostream &out) {
  if (!p) {
    out << "# ";
  } else {
    out << p->data << " ";
    writeBinaryTree(p->left, out);
    writeBinaryTree(p->right, out);
  }
}

如你所见，一个＃符号用于表示空节点。

As you can see, a # symbol is used to represent the null node.

要将此字符串反序列化为一棵树，您可以使用：

To deserialize this string into a tree you can use:

void readBinaryTree(BinaryTree *&p, ifstream &fin) {
  int token;
  bool isNumber;
  if (!readNextToken(token, fin, isNumber)) 
    return;
  if (isNumber) {
    p = new BinaryTree(token);
    readBinaryTree(p->left, fin);
    readBinaryTree(p->right, fin);
  }
}

如前所述，此方法生成轻量级表示的二叉树。

As I said before, this method produces a lightweight representation of Binary Tree.

当然，它有一个严重的缺点：它需要一个符号来表示空节点。

Of course it has one serious drawback: it requires a symbol to represent the null node.

如果树的节点是可以包含此符号的字符串，它可能会导致潜在的问题。

It can cause potential problems if the nodes of tree are strings that can contain this symbol itself.

这篇关于将二进制树保存到文件的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！